./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strlcat.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-dietlibc/strlcat.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 4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:11:07,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:11:07,731 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:11:07,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:11:07,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:11:07,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:11:07,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:11:07,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:11:07,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:11:07,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:11:07,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:11:07,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:11:07,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:11:07,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:11:07,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:11:07,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:11:07,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:11:07,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:11:07,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:11:07,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:11:07,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:11:07,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:11:07,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:11:07,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:11:07,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:11:07,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:11:07,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:11:07,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:11:07,763 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 -> 4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12 [2025-01-09 22:11:07,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:11:07,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:11:07,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:11:07,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:11:07,985 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:11:07,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcat.i [2025-01-09 22:11:09,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5dea1a8/baaef0a549e3452e8ded1391fb750be8/FLAG46fb00ad3 [2025-01-09 22:11:09,287 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:11:09,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i [2025-01-09 22:11:09,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5dea1a8/baaef0a549e3452e8ded1391fb750be8/FLAG46fb00ad3 [2025-01-09 22:11:09,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5dea1a8/baaef0a549e3452e8ded1391fb750be8 [2025-01-09 22:11:09,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:11:09,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:11:09,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:11:09,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:11:09,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:11:09,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28720203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09, skipping insertion in model container [2025-01-09 22:11:09,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:11:09,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:11:09,860 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:11:09,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:11:09,901 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:11:09,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09 WrapperNode [2025-01-09 22:11:09,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:11:09,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:11:09,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:11:09,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:11:09,906 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:11:09" (1/1) ... [2025-01-09 22:11:09,913 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:11:09" (1/1) ... [2025-01-09 22:11:09,930 INFO L138 Inliner]: procedures = 114, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-01-09 22:11:09,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:11:09,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:11:09,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:11:09,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:11:09,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,954 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [4, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2025-01-09 22:11:09,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:11:09,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:11:09,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:11:09,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:11:09,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (1/1) ... [2025-01-09 22:11:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:11:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:11:09,987 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:11:09,989 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:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:11:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:11:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:11:10,083 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:11:10,084 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:11:10,278 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 22:11:10,278 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:11:10,287 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:11:10,288 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 22:11:10,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:11:10 BoogieIcfgContainer [2025-01-09 22:11:10,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:11:10,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:11:10,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:11:10,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:11:10,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:11:09" (1/3) ... [2025-01-09 22:11:10,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555c32b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:11:10, skipping insertion in model container [2025-01-09 22:11:10,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:11:09" (2/3) ... [2025-01-09 22:11:10,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555c32b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:11:10, skipping insertion in model container [2025-01-09 22:11:10,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:11:10" (3/3) ... [2025-01-09 22:11:10,296 INFO L128 eAbstractionObserver]: Analyzing ICFG strlcat.i [2025-01-09 22:11:10,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:11:10,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strlcat.i that has 1 procedures, 51 locations, 1 initial locations, 3 loop locations, and 17 error locations. [2025-01-09 22:11:10,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:11:10,348 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;@1ee30e54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:11:10,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 22:11:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.878787878787879) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:11:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:11:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:10,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:11:10,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 925708, now seen corresponding path program 1 times [2025-01-09 22:11:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901706008] [2025-01-09 22:11:10,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:10,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:11:10,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:11:10,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:10,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:10,462 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:11:10,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901706008] [2025-01-09 22:11:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901706008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:10,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:11:10,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487122556] [2025-01-09 22:11:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:11:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:10,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:11:10,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:10,487 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.878787878787879) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:11:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:10,524 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-01-09 22:11:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:11:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-01-09 22:11:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:10,531 INFO L225 Difference]: With dead ends: 52 [2025-01-09 22:11:10,532 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:11:10,533 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:11:10,538 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:10,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:11:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:11:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.75) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-01-09 22:11:10,563 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 4 [2025-01-09 22:11:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:10,563 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-01-09 22:11:10,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:11:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-01-09 22:11:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:11:10,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:10,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:11:10,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:11:10,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:10,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2025-01-09 22:11:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:10,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674428932] [2025-01-09 22:11:10,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:10,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:11:10,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:11:10,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:10,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:10,622 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:11:10,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674428932] [2025-01-09 22:11:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674428932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:11:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416909280] [2025-01-09 22:11:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:10,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:11:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:10,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:11:10,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:10,625 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:11:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:10,663 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-01-09 22:11:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:11:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-01-09 22:11:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:10,664 INFO L225 Difference]: With dead ends: 48 [2025-01-09 22:11:10,664 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 22:11:10,664 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:11:10,664 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:10,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 22:11:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 22:11:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.71875) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-01-09 22:11:10,668 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 4 [2025-01-09 22:11:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-01-09 22:11:10,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:11:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-01-09 22:11:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:11:10,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:10,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:11:10,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:11:10,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2025-01-09 22:11:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671572999] [2025-01-09 22:11:10,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:11:10,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:11:10,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:10,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:10,818 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:11:10,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:10,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671572999] [2025-01-09 22:11:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671572999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414966063] [2025-01-09 22:11:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:10,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:11:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:10,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:11:10,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:10,822 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:11:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:10,856 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-01-09 22:11:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:10,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-01-09 22:11:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:10,856 INFO L225 Difference]: With dead ends: 47 [2025-01-09 22:11:10,857 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 22:11:10,857 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:11:10,857 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:10,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 22:11:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 22:11:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.6875) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-01-09 22:11:10,860 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 4 [2025-01-09 22:11:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:10,860 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-01-09 22:11:10,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:11:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-01-09 22:11:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:11:10,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:10,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:10,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:11:10,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:10,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2025-01-09 22:11:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275376554] [2025-01-09 22:11:10,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:10,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:11:10,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:11:10,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:10,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:10,915 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:11:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:10,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275376554] [2025-01-09 22:11:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275376554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:11:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428644751] [2025-01-09 22:11:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:11:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:10,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:11:10,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:10,917 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:10,948 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-01-09 22:11:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:11:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:11:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:10,949 INFO L225 Difference]: With dead ends: 46 [2025-01-09 22:11:10,949 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 22:11:10,949 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:11:10,949 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:10,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 22:11:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 22:11:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.65625) internal successors, (53), 45 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:11:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-01-09 22:11:10,955 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 7 [2025-01-09 22:11:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:10,955 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-01-09 22:11:10,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-01-09 22:11:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:11:10,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:10,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:10,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:11:10,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2025-01-09 22:11:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364958722] [2025-01-09 22:11:10,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:10,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:11:10,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:11:10,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:10,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:11,079 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:11:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:11,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364958722] [2025-01-09 22:11:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364958722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:11,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9910995] [2025-01-09 22:11:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:11,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:11:11,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:11,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:11:11,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:11,080 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:11,093 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-01-09 22:11:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:11:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:11,094 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:11:11,096 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:11:11,096 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:11:11,096 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:11,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:11:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 22:11:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.625) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-01-09 22:11:11,099 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 7 [2025-01-09 22:11:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:11,099 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-01-09 22:11:11,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-01-09 22:11:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:11:11,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:11,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:11,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:11:11,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:11,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782727, now seen corresponding path program 1 times [2025-01-09 22:11:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:11,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458985424] [2025-01-09 22:11:11,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:11,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:11:11,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:11:11,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:11,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:11,173 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:11:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458985424] [2025-01-09 22:11:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458985424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187119938] [2025-01-09 22:11:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:11:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:11,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:11:11,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:11,175 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:11,205 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-01-09 22:11:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:11:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:11,206 INFO L225 Difference]: With dead ends: 46 [2025-01-09 22:11:11,206 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:11:11,206 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:11:11,207 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:11,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:11:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 22:11:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.59375) internal successors, (51), 44 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:11:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-01-09 22:11:11,209 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 7 [2025-01-09 22:11:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:11,209 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-01-09 22:11:11,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-01-09 22:11:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:11:11,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:11,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:11:11,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383917, now seen corresponding path program 1 times [2025-01-09 22:11:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720031073] [2025-01-09 22:11:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:11,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:11:11,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:11:11,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:11,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:11,285 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:11:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720031073] [2025-01-09 22:11:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720031073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:11:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224659542] [2025-01-09 22:11:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:11:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:11:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:11:11,287 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:11:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:11,328 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-01-09 22:11:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:11:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:11,330 INFO L225 Difference]: With dead ends: 44 [2025-01-09 22:11:11,330 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:11:11,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:11:11,331 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:11,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 57 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:11:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-01-09 22:11:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.53125) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-01-09 22:11:11,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 9 [2025-01-09 22:11:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:11,335 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-01-09 22:11:11,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:11:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-01-09 22:11:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:11:11,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:11,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:11:11,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:11,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2025-01-09 22:11:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502321413] [2025-01-09 22:11:11,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:11,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:11:11,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:11:11,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:11,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:11,509 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:11:11,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502321413] [2025-01-09 22:11:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502321413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:11:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829554858] [2025-01-09 22:11:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:11,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:11:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:11,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:11:11,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:11,511 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:11:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:11,578 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-01-09 22:11:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:11:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:11:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:11,579 INFO L225 Difference]: With dead ends: 66 [2025-01-09 22:11:11,579 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 22:11:11,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:11,580 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:11,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 139 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:11:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 22:11:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2025-01-09 22:11:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.558139534883721) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-01-09 22:11:11,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 9 [2025-01-09 22:11:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:11,583 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-01-09 22:11:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:11:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-01-09 22:11:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:11:11,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:11,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:11:11,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash 163699877, now seen corresponding path program 1 times [2025-01-09 22:11:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441320781] [2025-01-09 22:11:11,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:11,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:11:11,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:11:11,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:11,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441320781] [2025-01-09 22:11:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441320781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810504420] [2025-01-09 22:11:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:11,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:11:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:11,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:11:11,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:11,609 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:11,616 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-01-09 22:11:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:11:11,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:11:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:11,617 INFO L225 Difference]: With dead ends: 56 [2025-01-09 22:11:11,617 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 22:11:11,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:11,617 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:11,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 22:11:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 22:11:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 55 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2025-01-09 22:11:11,620 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 14 [2025-01-09 22:11:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2025-01-09 22:11:11,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2025-01-09 22:11:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:11:11,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:11,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:11,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:11:11,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:11,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash 163640295, now seen corresponding path program 1 times [2025-01-09 22:11:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812872438] [2025-01-09 22:11:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:11:11,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:11:11,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:11,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812872438] [2025-01-09 22:11:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812872438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:11:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656353404] [2025-01-09 22:11:11,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:11,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:11:11,942 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:11:11,944 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:11:11,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:11:11,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:11:11,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:11,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:12,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 22:11:12,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:11:12,054 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:11:12,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:11:12,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:11:12,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:11:12,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:11:12,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:11:12,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:11:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:12,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:11:12,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-01-09 22:11:12,664 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:11:12,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:11:12,673 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:11:12,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-09 22:11:12,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-09 22:11:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656353404] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:11:12,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:11:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-01-09 22:11:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827449030] [2025-01-09 22:11:12,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:11:12,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:11:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:12,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:11:12,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:11:12,703 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:11:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:13,268 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2025-01-09 22:11:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:11:13,268 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:11:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:13,269 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:11:13,269 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:11:13,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:11:13,270 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 233 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:13,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 789 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:11:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:11:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 64. [2025-01-09 22:11:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2025-01-09 22:11:13,274 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 14 [2025-01-09 22:11:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:13,274 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2025-01-09 22:11:13,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:11:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2025-01-09 22:11:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:11:13,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:13,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:13,284 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:11:13,475 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,SelfDestructingSolverStorable9 [2025-01-09 22:11:13,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:13,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 779793852, now seen corresponding path program 1 times [2025-01-09 22:11:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:13,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629510130] [2025-01-09 22:11:13,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:13,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:11:13,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:11:13,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:13,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:13,519 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:11:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629510130] [2025-01-09 22:11:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629510130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:13,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257100349] [2025-01-09 22:11:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:13,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:11:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:13,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:11:13,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:13,521 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:11:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:13,555 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2025-01-09 22:11:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:13,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:11:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:13,556 INFO L225 Difference]: With dead ends: 63 [2025-01-09 22:11:13,556 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 22:11:13,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:13,556 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:13,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 22:11:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-01-09 22:11:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.509433962264151) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:11:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-01-09 22:11:13,558 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 15 [2025-01-09 22:11:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:13,561 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-01-09 22:11:13,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:11:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-01-09 22:11:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:11:13,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:13,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:13,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:11:13,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:13,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash 779793853, now seen corresponding path program 1 times [2025-01-09 22:11:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313127898] [2025-01-09 22:11:13,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:11:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:11:13,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:13,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:13,680 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:11:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313127898] [2025-01-09 22:11:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313127898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:11:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777313290] [2025-01-09 22:11:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:13,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:11:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:13,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:11:13,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:11:13,682 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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:11:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:13,731 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2025-01-09 22:11:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:11:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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:11:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:13,732 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:11:13,732 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:11:13,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:13,732 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:13,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 111 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:11:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2025-01-09 22:11:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 69 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:11:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-01-09 22:11:13,735 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 15 [2025-01-09 22:11:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:13,735 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-01-09 22:11:13,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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:11:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-01-09 22:11:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:11:13,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:13,736 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:11:13,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:11:13,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:13,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1596220099, now seen corresponding path program 1 times [2025-01-09 22:11:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:13,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097328298] [2025-01-09 22:11:13,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:13,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:11:13,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:11:13,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:13,785 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:11:13,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:13,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097328298] [2025-01-09 22:11:13,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097328298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:13,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:13,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:11:13,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139109026] [2025-01-09 22:11:13,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:13,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:11:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:13,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:11:13,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:11:13,786 INFO L87 Difference]: Start difference. First operand 70 states and 92 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:11:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:13,841 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2025-01-09 22:11:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:11:13,842 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:11:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:13,842 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:11:13,842 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:11:13,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:11:13,843 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:13,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:11:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:11:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-01-09 22:11:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 68 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:11:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-01-09 22:11:13,845 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 16 [2025-01-09 22:11:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:13,845 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-01-09 22:11:13,845 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:11:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-01-09 22:11:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:11:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:13,845 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:11:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:11:13,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1596220098, now seen corresponding path program 1 times [2025-01-09 22:11:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24677134] [2025-01-09 22:11:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:13,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:11:13,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:11:13,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:13,945 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:11:13,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:13,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24677134] [2025-01-09 22:11:13,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24677134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:13,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:13,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:11:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742781109] [2025-01-09 22:11:13,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:13,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:11:13,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:13,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:11:13,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:13,946 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:11:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:14,026 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2025-01-09 22:11:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:11:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:11:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:14,028 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:11:14,028 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:11:14,028 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:11:14,029 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:14,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 119 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:11:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:11:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2025-01-09 22:11:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 69 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:11:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-01-09 22:11:14,034 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 16 [2025-01-09 22:11:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-01-09 22:11:14,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:11:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-01-09 22:11:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:11:14,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:14,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:14,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:11:14,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:14,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash -664233137, now seen corresponding path program 1 times [2025-01-09 22:11:14,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:14,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331930084] [2025-01-09 22:11:14,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:14,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:11:14,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:11:14,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:14,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:14,111 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:11:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331930084] [2025-01-09 22:11:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331930084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:11:14,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539578443] [2025-01-09 22:11:14,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:14,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:11:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:14,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:11:14,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:11:14,112 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:14,137 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2025-01-09 22:11:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:11:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:11:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:14,137 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:11:14,137 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:11:14,137 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:11:14,138 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:14,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:11:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:11:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.467741935483871) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:11:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-01-09 22:11:14,139 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 18 [2025-01-09 22:11:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:14,140 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-01-09 22:11:14,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-01-09 22:11:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:11:14,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:14,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:14,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:11:14,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1653219094, now seen corresponding path program 1 times [2025-01-09 22:11:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116785642] [2025-01-09 22:11:14,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:14,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:11:14,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:14,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:14,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116785642] [2025-01-09 22:11:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116785642] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:11:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143365151] [2025-01-09 22:11:14,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:14,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:14,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:11:14,338 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:11:14,340 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:11:14,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:11:14,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:14,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:14,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:14,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:11:14,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:11:14,428 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:11:14,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:11:14,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:11:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:14,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:11:14,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-01-09 22:11:14,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:11:14,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-09 22:11:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143365151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:11:14,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:11:14,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 22:11:14,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642006544] [2025-01-09 22:11:14,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:11:14,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:11:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:14,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:11:14,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:11:14,772 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:15,053 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2025-01-09 22:11:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:11:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:11:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:15,054 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:11:15,054 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:11:15,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:11:15,055 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 87 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:15,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 320 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:11:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:11:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2025-01-09 22:11:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 78 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:11:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2025-01-09 22:11:15,057 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 19 [2025-01-09 22:11:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2025-01-09 22:11:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2025-01-09 22:11:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:11:15,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:15,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:15,064 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:11:15,262 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,SelfDestructingSolverStorable15 [2025-01-09 22:11:15,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1653210149, now seen corresponding path program 1 times [2025-01-09 22:11:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:15,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989586349] [2025-01-09 22:11:15,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:15,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:11:15,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:15,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:15,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:15,293 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:11:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989586349] [2025-01-09 22:11:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989586349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360188791] [2025-01-09 22:11:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:11:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:15,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:11:15,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:15,295 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:15,326 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2025-01-09 22:11:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:11:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:15,327 INFO L225 Difference]: With dead ends: 79 [2025-01-09 22:11:15,327 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 22:11:15,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:11:15,328 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 57 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:11:15,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 57 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 22:11:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-01-09 22:11:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 72 states have (on average 1.375) internal successors, (99), 77 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:11:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-01-09 22:11:15,332 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 19 [2025-01-09 22:11:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:15,333 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-01-09 22:11:15,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2025-01-09 22:11:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:11:15,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:15,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:11:15,334 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:15,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1653210150, now seen corresponding path program 1 times [2025-01-09 22:11:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471277121] [2025-01-09 22:11:15,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:15,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:11:15,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:15,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:15,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:15,400 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:11:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471277121] [2025-01-09 22:11:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471277121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:11:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600265942] [2025-01-09 22:11:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:15,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:11:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:15,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:11:15,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:15,402 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:15,446 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2025-01-09 22:11:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:11:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:11:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:15,447 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:11:15,447 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:11:15,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:15,447 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:15,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:11:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2025-01-09 22:11:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 93 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:11:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2025-01-09 22:11:15,450 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 19 [2025-01-09 22:11:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2025-01-09 22:11:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2025-01-09 22:11:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:11:15,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:15,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:15,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:11:15,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash 884962906, now seen corresponding path program 1 times [2025-01-09 22:11:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:15,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145850638] [2025-01-09 22:11:15,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:15,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:15,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:11:15,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:15,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:15,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:11:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145850638] [2025-01-09 22:11:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145850638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:15,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:15,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:11:15,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128701977] [2025-01-09 22:11:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:15,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:11:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:15,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:11:15,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:15,522 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:15,564 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2025-01-09 22:11:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:11:15,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:11:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:15,565 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:11:15,565 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:11:15,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:11:15,565 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:15,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 152 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:11:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2025-01-09 22:11:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 93 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2025-01-09 22:11:15,567 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 19 [2025-01-09 22:11:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2025-01-09 22:11:15,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2025-01-09 22:11:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:11:15,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:15,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:15,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:11:15,568 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:15,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1076845838, now seen corresponding path program 2 times [2025-01-09 22:11:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171034356] [2025-01-09 22:11:15,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:11:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:15,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 22:11:15,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:15,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:11:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171034356] [2025-01-09 22:11:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171034356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:11:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568192056] [2025-01-09 22:11:15,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:11:15,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:15,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:11:15,953 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:11:15,954 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:11:15,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 22:11:16,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:11:16,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:11:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:16,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 22:11:16,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:11:16,038 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:11:16,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:11:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:11:16,092 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:11:16,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:11:16,341 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-01-09 22:11:16,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2025-01-09 22:11:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:16,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:11:16,821 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 49 treesize of output 45 [2025-01-09 22:11:16,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:11:16,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-01-09 22:11:16,863 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:11:16,867 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 29 treesize of output 23 [2025-01-09 22:11:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568192056] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:11:16,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:11:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2025-01-09 22:11:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200116691] [2025-01-09 22:11:16,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:11:16,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:11:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:16,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:11:16,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:11:16,900 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 33 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:11:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:18,020 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2025-01-09 22:11:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:11:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 33 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 19 [2025-01-09 22:11:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:18,021 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:11:18,021 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:11:18,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 22:11:18,023 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 296 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:18,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1039 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:11:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:11:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 106. [2025-01-09 22:11:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 105 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2025-01-09 22:11:18,025 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 19 [2025-01-09 22:11:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:18,025 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2025-01-09 22:11:18,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 33 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:11:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2025-01-09 22:11:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:11:18,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:18,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:18,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:11:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:18,227 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:18,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash -287782114, now seen corresponding path program 1 times [2025-01-09 22:11:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922998629] [2025-01-09 22:11:18,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:18,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:11:18,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:11:18,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:18,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:18,344 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:11:18,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:18,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922998629] [2025-01-09 22:11:18,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922998629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:18,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:11:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259484671] [2025-01-09 22:11:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:18,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:11:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:18,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:11:18,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:18,346 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:11:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:18,368 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2025-01-09 22:11:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:11:18,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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:11:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:18,368 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:11:18,368 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:11:18,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:18,369 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:18,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 85 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:18,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:11:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:11:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 98 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2025-01-09 22:11:18,370 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 20 [2025-01-09 22:11:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:18,371 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2025-01-09 22:11:18,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:11:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2025-01-09 22:11:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:11:18,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:18,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:18,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:11:18,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:18,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1012714513, now seen corresponding path program 2 times [2025-01-09 22:11:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444491905] [2025-01-09 22:11:18,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:11:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:18,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 22:11:18,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:11:18,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:11:18,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444491905] [2025-01-09 22:11:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444491905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:11:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403024734] [2025-01-09 22:11:18,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:11:18,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:11:18,618 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:11:18,620 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:11:18,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 22:11:18,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:11:18,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:11:18,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:18,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:11:18,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:11:18,680 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:11:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:18,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:11:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403024734] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 22:11:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:11:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 21 [2025-01-09 22:11:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292493524] [2025-01-09 22:11:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:18,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:11:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:18,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:11:18,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:11:18,933 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:11:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:19,008 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-01-09 22:11:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:11:19,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:11:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:19,009 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:11:19,009 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 22:11:19,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:11:19,011 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:19,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:11:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 22:11:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2025-01-09 22:11:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:11:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-01-09 22:11:19,013 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 23 [2025-01-09 22:11:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:19,013 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-01-09 22:11:19,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:11:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-01-09 22:11:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:11:19,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:19,013 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:19,020 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:11:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 22:11:19,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:11:19,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 321576858, now seen corresponding path program 1 times [2025-01-09 22:11:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244637518] [2025-01-09 22:11:19,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:11:19,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:11:19,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:19,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:11:19,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:11:19,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:11:19,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:11:19,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:11:19,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:11:19,247 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:11:19,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2025-01-09 22:11:19,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2025-01-09 22:11:19,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:11:19,252 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:19,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:11:19,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:11:19 BoogieIcfgContainer [2025-01-09 22:11:19,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:11:19,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:11:19,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:11:19,278 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:11:19,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:11:10" (3/4) ... [2025-01-09 22:11:19,279 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 22:11:19,313 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 22:11:19,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:11:19,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:11:19,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:11:19,349 INFO L158 Benchmark]: Toolchain (without parser) took 9721.44ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.4MB in the beginning and 127.5MB in the end (delta: -15.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-01-09 22:11:19,350 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:11:19,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.45ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:11:19,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.57ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:11:19,351 INFO L158 Benchmark]: Boogie Preprocessor took 33.29ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:11:19,351 INFO L158 Benchmark]: RCFGBuilder took 325.75ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 74.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:11:19,351 INFO L158 Benchmark]: TraceAbstraction took 8986.26ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 74.4MB in the beginning and 133.6MB in the end (delta: -59.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2025-01-09 22:11:19,351 INFO L158 Benchmark]: Witness Printer took 69.79ms. Allocated memory is still 218.1MB. Free memory was 133.6MB in the beginning and 127.5MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:11:19,353 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.23ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.45ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.57ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.29ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.75ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 74.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8986.26ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 74.4MB in the beginning and 133.6MB in the end (delta: -59.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 69.79ms. Allocated memory is still 218.1MB. Free memory was 133.6MB in the beginning and 127.5MB in the end (delta: 6.1MB). 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L538] int in_len = __VERIFIER_nondet_int(); [L539] COND FALSE !(in_len < 1) [L540] char* in = __builtin_alloca (in_len); VAL [in={4:0}, in_len=1] [L541] in[in_len-1]=0 [L542] int out_len = __VERIFIER_nondet_int(); [L543] COND FALSE !(out_len < 1) [L544] char* out = __builtin_alloca (out_len); VAL [in={4:0}, out={3:0}, out_len=2] [L545] out[out_len-1]=0 [L546] CALL strlcat(in, out, out_len) [L517] register char *d = dst; [L518] register const char *s = src; [L519] register size_t n = siz; [L520] size_t dlen; VAL [d={4:0}, n=2, s={3:0}, siz=2] [L521] EXPR \read(*d) [L521] *d != '\0' && n-- != 0 VAL [d={4:0}, n=2, s={3:0}, siz=2] [L521] COND FALSE !(*d != '\0' && n-- != 0) [L523] dlen = d - dst [L524] n = siz - dlen VAL [d={4:0}, dlen=0, n=2, s={3:0}] [L525] COND FALSE !(n == 0) [L527] EXPR \read(*s) [L527] COND TRUE *s != '\0' [L528] COND TRUE n != 1 [L529] EXPR d++ VAL [d={4:1}, dlen=0, n=2, s={3:0}] [L529] EXPR \read(*s) [L529] *d++ = *s [L530] n-- VAL [d={4:1}, dlen=0, n=1, s={3:0}] [L532] s++ VAL [d={4:1}, dlen=0, n=1, s={3:1}] [L527] EXPR \read(*s) [L527] COND FALSE !(*s != '\0') [L534] *d = '\0' - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 866 mSDsluCounter, 4004 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3088 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3129 IncrementalHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 916 mSDtfsCounter, 3129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=20, InterpolantAutomatonStates: 128, 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, 22 MinimizatonAttempts, 237 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 417 ConstructedInterpolants, 30 QuantifiedInterpolants, 4018 SizeOfPredicates, 32 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 14/47 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 22:11:19,365 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)