./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cmemchr-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cmemchr-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7f0d11c5f3d4193dc8b87cb3dbae552e2a558805da02a0660bf5cf3361799dbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:12:36,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:12:36,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:12:36,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:12:36,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:12:37,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:12:37,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:12:37,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:12:37,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:12:37,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:12:37,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:12:37,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:12:37,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:12:37,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:12:37,025 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:12:37,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:12:37,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:12:37,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:37,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:12:37,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:37,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:12:37,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:12:37,028 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 -> 7f0d11c5f3d4193dc8b87cb3dbae552e2a558805da02a0660bf5cf3361799dbf [2025-01-09 22:12:37,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:12:37,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:12:37,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:12:37,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:12:37,332 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:12:37,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cmemchr-alloca-1.i [2025-01-09 22:12:38,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67ded3f63/2e51e2fb395d48a68fe016db11930109/FLAGe0acadb84 [2025-01-09 22:12:38,933 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:12:38,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cmemchr-alloca-1.i [2025-01-09 22:12:38,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67ded3f63/2e51e2fb395d48a68fe016db11930109/FLAGe0acadb84 [2025-01-09 22:12:39,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67ded3f63/2e51e2fb395d48a68fe016db11930109 [2025-01-09 22:12:39,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:12:39,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:12:39,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:12:39,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:12:39,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:12:39,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b1623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39, skipping insertion in model container [2025-01-09 22:12:39,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:12:39,522 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:12:39,531 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:12:39,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:12:39,541 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:12:39,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:12:39,597 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:12:39,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39 WrapperNode [2025-01-09 22:12:39,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:12:39,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:12:39,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:12:39,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:12:39,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,629 INFO L138 Inliner]: procedures = 111, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-01-09 22:12:39,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:12:39,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:12:39,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:12:39,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:12:39,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,651 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 0 writes are split as follows [0]. [2025-01-09 22:12:39,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:12:39,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:12:39,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:12:39,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:12:39,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (1/1) ... [2025-01-09 22:12:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:39,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:12:39,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:12:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:12:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:12:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:12:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:12:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:12:39,803 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:12:39,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:12:39,901 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 22:12:39,902 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:12:39,909 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:12:39,910 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:12:39,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:39 BoogieIcfgContainer [2025-01-09 22:12:39,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:12:39,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:12:39,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:12:39,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:12:39,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:12:39" (1/3) ... [2025-01-09 22:12:39,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68245313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:12:39, skipping insertion in model container [2025-01-09 22:12:39,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:39" (2/3) ... [2025-01-09 22:12:39,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68245313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:12:39, skipping insertion in model container [2025-01-09 22:12:39,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:39" (3/3) ... [2025-01-09 22:12:39,920 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca-1.i [2025-01-09 22:12:39,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:12:39,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cmemchr-alloca-1.i that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-01-09 22:12:39,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:12:39,987 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;@76ac6df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:12:39,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 22:12:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:12:39,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:39,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:39,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:39,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash 121322254, now seen corresponding path program 1 times [2025-01-09 22:12:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560314125] [2025-01-09 22:12:40,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:40,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:12:40,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:12:40,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:40,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:40,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560314125] [2025-01-09 22:12:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560314125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:40,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:40,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055684061] [2025-01-09 22:12:40,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:40,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:12:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:40,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:12:40,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:12:40,621 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:40,705 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-01-09 22:12:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:12:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:12:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:40,728 INFO L225 Difference]: With dead ends: 21 [2025-01-09 22:12:40,729 INFO L226 Difference]: Without dead ends: 19 [2025-01-09 22:12:40,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:12:40,732 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:40,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-09 22:12:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2025-01-09 22:12:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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:12:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-01-09 22:12:40,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 8 [2025-01-09 22:12:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:40,756 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-01-09 22:12:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-01-09 22:12:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:12:40,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:40,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:40,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:12:40,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:40,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash 121322255, now seen corresponding path program 1 times [2025-01-09 22:12:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:40,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129502359] [2025-01-09 22:12:40,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:12:40,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:12:40,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:40,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129502359] [2025-01-09 22:12:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129502359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:40,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185071094] [2025-01-09 22:12:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:40,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:12:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:40,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:12:40,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:12:40,976 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:41,021 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2025-01-09 22:12:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:12:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:12:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:41,023 INFO L225 Difference]: With dead ends: 22 [2025-01-09 22:12:41,023 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 22:12:41,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:12:41,024 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:41,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 22:12:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-01-09 22:12:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-01-09 22:12:41,028 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 8 [2025-01-09 22:12:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:41,028 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-09 22:12:41,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-01-09 22:12:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:12:41,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:41,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:12:41,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:41,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 123169297, now seen corresponding path program 1 times [2025-01-09 22:12:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882585977] [2025-01-09 22:12:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:41,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:12:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:12:41,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882585977] [2025-01-09 22:12:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882585977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:12:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551386922] [2025-01-09 22:12:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:41,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:12:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:41,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:12:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:12:41,216 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:41,268 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-01-09 22:12:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:12:41,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:12:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:41,269 INFO L225 Difference]: With dead ends: 24 [2025-01-09 22:12:41,269 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 22:12:41,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:12:41,270 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:41,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 22:12:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2025-01-09 22:12:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-09 22:12:41,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2025-01-09 22:12:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:41,275 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-09 22:12:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-01-09 22:12:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:12:41,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:41,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:41,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:12:41,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -533240566, now seen corresponding path program 1 times [2025-01-09 22:12:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983633927] [2025-01-09 22:12:41,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:41,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:12:41,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:12:41,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:41,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983633927] [2025-01-09 22:12:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983633927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:41,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:12:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345205521] [2025-01-09 22:12:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:12:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:41,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:12:41,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:41,338 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:12:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:41,356 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-01-09 22:12:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:12:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:12:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:41,357 INFO L225 Difference]: With dead ends: 24 [2025-01-09 22:12:41,357 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 22:12:41,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:41,358 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:41,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 22:12:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-01-09 22:12:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-09 22:12:41,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2025-01-09 22:12:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:41,363 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-09 22:12:41,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:12:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-01-09 22:12:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:12:41,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:41,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:41,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:12:41,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -475982264, now seen corresponding path program 1 times [2025-01-09 22:12:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138783966] [2025-01-09 22:12:41,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:41,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:12:41,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:12:41,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:41,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:41,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138783966] [2025-01-09 22:12:41,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138783966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:41,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:41,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:41,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907036995] [2025-01-09 22:12:41,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:41,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:41,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:41,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:41,475 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 1.8) 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:12:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:41,495 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-01-09 22:12:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:12:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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:12:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:41,495 INFO L225 Difference]: With dead ends: 22 [2025-01-09 22:12:41,495 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 22:12:41,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:41,496 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:41,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 40 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 22:12:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-01-09 22:12:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-01-09 22:12:41,501 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2025-01-09 22:12:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:41,501 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-01-09 22:12:41,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) 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:12:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-01-09 22:12:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:12:41,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:41,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:12:41,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2051195727, now seen corresponding path program 1 times [2025-01-09 22:12:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957676948] [2025-01-09 22:12:41,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:41,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:12:41,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:12:41,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:41,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957676948] [2025-01-09 22:12:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957676948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:12:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952450758] [2025-01-09 22:12:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:12:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:41,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:12:41,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:41,568 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:41,585 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-01-09 22:12:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:12:41,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 22:12:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:41,586 INFO L225 Difference]: With dead ends: 17 [2025-01-09 22:12:41,586 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 22:12:41,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:41,586 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:41,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 22:12:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 22:12:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-09 22:12:41,590 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-01-09 22:12:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:41,590 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-09 22:12:41,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-01-09 22:12:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:12:41,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:41,591 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:41,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:12:41,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:41,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash 837488211, now seen corresponding path program 1 times [2025-01-09 22:12:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286923377] [2025-01-09 22:12:41,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:12:41,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:12:41,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:41,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286923377] [2025-01-09 22:12:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286923377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:41,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850620239] [2025-01-09 22:12:41,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:41,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:41,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:41,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:41,691 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:41,708 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-01-09 22:12:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:12:41,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 22:12:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:41,709 INFO L225 Difference]: With dead ends: 19 [2025-01-09 22:12:41,709 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 22:12:41,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:41,710 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:41,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 22:12:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 22:12:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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:12:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-01-09 22:12:41,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2025-01-09 22:12:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:41,712 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-01-09 22:12:41,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-01-09 22:12:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:12:41,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:41,713 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:41,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:12:41,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:41,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1517546581, now seen corresponding path program 1 times [2025-01-09 22:12:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131195124] [2025-01-09 22:12:41,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:41,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:12:41,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:12:41,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:41,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131195124] [2025-01-09 22:12:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131195124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:12:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229626094] [2025-01-09 22:12:42,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:42,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:42,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:12:42,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:12:42,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:12:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:12:42,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:42,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:42,204 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:12:42,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:12:42,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 22:12:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:42,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:12:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:42,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229626094] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:12:42,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:12:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-01-09 22:12:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163657752] [2025-01-09 22:12:42,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:12:42,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:12:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:42,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:12:42,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:12:42,996 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:43,162 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-01-09 22:12:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:12:43,163 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 22:12:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:43,163 INFO L225 Difference]: With dead ends: 17 [2025-01-09 22:12:43,163 INFO L226 Difference]: Without dead ends: 17 [2025-01-09 22:12:43,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:12:43,164 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:43,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-09 22:12:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-09 22:12:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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:12:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-01-09 22:12:43,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2025-01-09 22:12:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:43,166 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-09 22:12:43,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-01-09 22:12:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:12:43,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:43,169 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:43,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:12:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:43,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:12:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -348279655, now seen corresponding path program 2 times [2025-01-09 22:12:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019410277] [2025-01-09 22:12:43,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:12:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:43,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 22:12:43,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:43,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:12:43,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019410277] [2025-01-09 22:12:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019410277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:12:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694335904] [2025-01-09 22:12:43,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:12:43,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:43,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:43,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:12:43,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:12:44,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 22:12:44,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:44,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:12:44,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:44,050 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 22:12:44,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:12:44,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 22:12:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:44,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:12:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694335904] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:12:45,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:12:45,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2025-01-09 22:12:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282140258] [2025-01-09 22:12:45,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:12:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 22:12:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:45,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 22:12:45,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 22:12:45,384 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:45,948 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-01-09 22:12:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:12:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:12:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:45,948 INFO L225 Difference]: With dead ends: 20 [2025-01-09 22:12:45,948 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:12:45,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 22:12:45,950 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:45,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:12:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:12:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:12:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:12:45,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2025-01-09 22:12:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:45,951 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:12:45,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:12:45,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:12:45,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 3 remaining) [2025-01-09 22:12:45,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2025-01-09 22:12:45,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 3 remaining) [2025-01-09 22:12:45,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:12:46,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:46,159 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:46,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:12:46,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:12:46 BoogieIcfgContainer [2025-01-09 22:12:46,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:12:46,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:12:46,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:12:46,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:12:46,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:39" (3/4) ... [2025-01-09 22:12:46,167 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:12:46,174 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 22:12:46,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 22:12:46,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 22:12:46,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:12:46,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:12:46,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:12:46,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:12:46,251 INFO L158 Benchmark]: Toolchain (without parser) took 7023.79ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.1MB in the beginning and 142.9MB in the end (delta: -30.7MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2025-01-09 22:12:46,252 INFO L158 Benchmark]: CDTParser took 1.60ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:46,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.72ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:12:46,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:46,252 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:46,253 INFO L158 Benchmark]: RCFGBuilder took 242.66ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 80.7MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:12:46,253 INFO L158 Benchmark]: TraceAbstraction took 6252.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 80.3MB in the beginning and 55.6MB in the end (delta: 24.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2025-01-09 22:12:46,253 INFO L158 Benchmark]: Witness Printer took 86.45ms. Allocated memory is still 176.2MB. Free memory was 55.6MB in the beginning and 142.9MB in the end (delta: -87.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:12:46,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.72ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 242.66ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 80.7MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6252.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 80.3MB in the beginning and 55.6MB in the end (delta: 24.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 86.45ms. Allocated memory is still 176.2MB. Free memory was 55.6MB in the beginning and 142.9MB in the end (delta: -87.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 111 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=2, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1532 SizeOfPredicates, 6 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 3/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:12:46,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE