./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/realloc1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/memsafety-ext3/realloc1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:23:47,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:23:47,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:23:47,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:23:47,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:23:47,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:23:47,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:23:47,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:23:47,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:23:47,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:23:47,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:23:47,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:23:47,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:23:47,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:23:47,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:47,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:47,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:23:47,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac04f74b68086890b55eca7e645e90e8df8a67932fce57d15e9ba2378d355360 [2025-01-09 22:23:47,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:23:47,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:23:47,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:23:47,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:23:47,559 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:23:47,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/realloc1.c [2025-01-09 22:23:48,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b29c7543/5a93ca893e284ab58c4b325af2c2bc62/FLAG7d03b2ac6 [2025-01-09 22:23:48,961 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:23:48,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c [2025-01-09 22:23:48,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b29c7543/5a93ca893e284ab58c4b325af2c2bc62/FLAG7d03b2ac6 [2025-01-09 22:23:49,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b29c7543/5a93ca893e284ab58c4b325af2c2bc62 [2025-01-09 22:23:49,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:23:49,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:23:49,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:49,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:23:49,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:23:49,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f00722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49, skipping insertion in model container [2025-01-09 22:23:49,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:23:49,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:49,564 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:23:49,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:49,603 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:23:49,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49 WrapperNode [2025-01-09 22:23:49,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:49,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:49,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:23:49,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:23:49,619 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:23:49" (1/1) ... [2025-01-09 22:23:49,627 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:23:49" (1/1) ... [2025-01-09 22:23:49,660 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2025-01-09 22:23:49,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:49,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:23:49,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:23:49,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:23:49,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,679 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 22:23:49,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,682 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:23:49,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:23:49,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:23:49,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:23:49,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (1/1) ... [2025-01-09 22:23:49,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:49,720 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:23:49,731 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:23:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 22:23:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:23:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:23:49,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:23:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 22:23:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:23:49,798 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:23:49,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:23:49,907 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-01-09 22:23:49,907 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:23:49,913 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:23:49,914 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:23:49,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:49 BoogieIcfgContainer [2025-01-09 22:23:49,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:23:49,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:23:49,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:23:49,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:23:49,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:23:49" (1/3) ... [2025-01-09 22:23:49,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e8fcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:49, skipping insertion in model container [2025-01-09 22:23:49,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:49" (2/3) ... [2025-01-09 22:23:49,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e8fcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:49, skipping insertion in model container [2025-01-09 22:23:49,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:49" (3/3) ... [2025-01-09 22:23:49,924 INFO L128 eAbstractionObserver]: Analyzing ICFG realloc1.c [2025-01-09 22:23:49,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:23:49,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realloc1.c that has 1 procedures, 24 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-01-09 22:23:49,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:23:49,977 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;@38982061, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:23:49,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 22:23:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:23:49,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:49,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:23:49,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:49,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:23:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012966546] [2025-01-09 22:23:49,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:50,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:23:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:23:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,137 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:23:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012966546] [2025-01-09 22:23:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012966546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177208260] [2025-01-09 22:23:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:50,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:50,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:50,162 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:50,205 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-01-09 22:23:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:23:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:50,210 INFO L225 Difference]: With dead ends: 25 [2025-01-09 22:23:50,210 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 22:23:50,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:50,213 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:50,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 22:23:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-01-09 22:23:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 19 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:23:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-09 22:23:50,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2025-01-09 22:23:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-09 22:23:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-09 22:23:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:23:50,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:50,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:23:50,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:23:50,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:50,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:23:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:50,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163434248] [2025-01-09 22:23:50,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:50,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:23:50,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:23:50,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,299 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:23:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163434248] [2025-01-09 22:23:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163434248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22728860] [2025-01-09 22:23:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:50,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:50,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:50,302 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:50,327 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-01-09 22:23:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:23:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:50,328 INFO L225 Difference]: With dead ends: 23 [2025-01-09 22:23:50,328 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 22:23:50,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:50,329 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:50,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 22:23:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-01-09 22:23:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 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:23:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-01-09 22:23:50,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 4 [2025-01-09 22:23:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:50,332 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-01-09 22:23:50,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-01-09 22:23:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:23:50,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:50,333 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 22:23:50,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:23:50,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:50,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:50,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1805828105, now seen corresponding path program 1 times [2025-01-09 22:23:50,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:50,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890698397] [2025-01-09 22:23:50,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:23:50,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:23:50,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,445 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:23:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890698397] [2025-01-09 22:23:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890698397] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802723726] [2025-01-09 22:23:50,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:50,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:50,449 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:23:50,453 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:23:50,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:23:50,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:23:50,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:23:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:50,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:23:50,570 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:23:50,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:50,620 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:23:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802723726] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:50,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 22:23:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339744356] [2025-01-09 22:23:50,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:23:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:50,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:23:50,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:23:50,621 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:50,699 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-01-09 22:23:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:23:50,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:23:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:50,700 INFO L225 Difference]: With dead ends: 26 [2025-01-09 22:23:50,700 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 22:23:50,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:23:50,701 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:50,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 37 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 22:23:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 22:23:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-01-09 22:23:50,705 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 7 [2025-01-09 22:23:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-09 22:23:50,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-01-09 22:23:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:23:50,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:50,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1] [2025-01-09 22:23:50,716 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:23:50,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:50,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:50,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash -632899673, now seen corresponding path program 1 times [2025-01-09 22:23:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:50,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753570599] [2025-01-09 22:23:50,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:50,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:23:50,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:23:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:23:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753570599] [2025-01-09 22:23:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753570599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854595105] [2025-01-09 22:23:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:50,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:50,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:50,993 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,001 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-01-09 22:23:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:23:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,002 INFO L225 Difference]: With dead ends: 28 [2025-01-09 22:23:51,002 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 22:23:51,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:51,003 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 22:23:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-01-09 22:23:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:23:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-01-09 22:23:51,007 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2025-01-09 22:23:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,008 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-01-09 22:23:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-01-09 22:23:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:23:51,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:23:51,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1854946663, now seen corresponding path program 1 times [2025-01-09 22:23:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039160934] [2025-01-09 22:23:51,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:23:51,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:23:51,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:51,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:23:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039160934] [2025-01-09 22:23:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039160934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558372255] [2025-01-09 22:23:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:51,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:51,078 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:23:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,091 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-01-09 22:23:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 14 [2025-01-09 22:23:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,092 INFO L225 Difference]: With dead ends: 27 [2025-01-09 22:23:51,092 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 22:23:51,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:51,093 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 22:23:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-01-09 22:23:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-09 22:23:51,095 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2025-01-09 22:23:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,095 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-09 22:23:51,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:23:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-09 22:23:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:23:51,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:23:51,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash 192316842, now seen corresponding path program 1 times [2025-01-09 22:23:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838489536] [2025-01-09 22:23:51,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:23:51,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:23:51,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838489536] [2025-01-09 22:23:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838489536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662953744] [2025-01-09 22:23:51,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:51,161 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:23:51,162 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:23:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:23:51,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:23:51,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:51,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:23:51,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:51,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662953744] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:51,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 22:23:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889041148] [2025-01-09 22:23:51,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:23:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:23:51,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:23:51,304 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:23:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,345 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-01-09 22:23:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:23:51,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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 16 [2025-01-09 22:23:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,346 INFO L225 Difference]: With dead ends: 39 [2025-01-09 22:23:51,346 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:23:51,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:23:51,347 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:23:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 22:23:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-01-09 22:23:51,354 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 16 [2025-01-09 22:23:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,354 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-01-09 22:23:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:23:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-01-09 22:23:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:23:51,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,355 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,362 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:23:51,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:51,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:51,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash 290881325, now seen corresponding path program 2 times [2025-01-09 22:23:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642436801] [2025-01-09 22:23:51,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 22:23:51,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:23:51,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:51,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642436801] [2025-01-09 22:23:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642436801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425941608] [2025-01-09 22:23:51,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:51,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:51,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:51,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:51,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:23:51,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 22:23:51,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:23:51,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:51,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:51,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:51,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425941608] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:51,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-01-09 22:23:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37015653] [2025-01-09 22:23:51,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:51,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:51,999 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:52,061 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2025-01-09 22:23:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:23:52,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 22:23:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:52,062 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:23:52,062 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:23:52,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:52,062 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:52,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:23:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 22:23:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-01-09 22:23:52,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 31 [2025-01-09 22:23:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:52,066 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-01-09 22:23:52,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-01-09 22:23:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:52,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:52,067 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:52,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:52,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-01-09 22:23:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1690577395, now seen corresponding path program 3 times [2025-01-09 22:23:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767936372] [2025-01-09 22:23:52,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:23:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:52,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 11 equivalence classes. [2025-01-09 22:23:52,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:52,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 22:23:52,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:23:52,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:23:52,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:52,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:52,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:52,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:23:52,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:23:52,325 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:23:52,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (4 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (3 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-01-09 22:23:52,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-09 22:23:52,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:23:52,330 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-01-09 22:23:52,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:23:52,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:23:52 BoogieIcfgContainer [2025-01-09 22:23:52,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:23:52,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:23:52,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:23:52,361 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:23:52,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:49" (3/4) ... [2025-01-09 22:23:52,362 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 22:23:52,393 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-01-09 22:23:52,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:23:52,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:23:52,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:23:52,430 INFO L158 Benchmark]: Toolchain (without parser) took 3113.66ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 118.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2025-01-09 22:23:52,430 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:52,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.91ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 122.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:23:52,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.07ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 121.8MB in the end (delta: 961.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:52,431 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:52,431 INFO L158 Benchmark]: RCFGBuilder took 221.21ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 108.7MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:23:52,431 INFO L158 Benchmark]: TraceAbstraction took 2444.95ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 124.6MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:52,431 INFO L158 Benchmark]: Witness Printer took 67.97ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 118.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:23:52,432 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.91ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 122.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.07ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 121.8MB in the end (delta: 961.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.21ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 108.7MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2444.95ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 124.6MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.97ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 118.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=0, p={-1:0}] [L10] i++ VAL [i=1, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=1, p={-1:0}] [L10] i++ VAL [i=2, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=2, p={-1:0}] [L10] i++ VAL [i=3, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=3, p={-1:0}] [L10] i++ VAL [i=4, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=4, p={-1:0}] [L10] i++ VAL [i=5, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=5, p={-1:0}] [L10] i++ VAL [i=6, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=6, p={-1:0}] [L10] i++ VAL [i=7, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=7, p={-1:0}] [L10] i++ VAL [i=8, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=8, p={-1:0}] [L10] i++ VAL [i=9, p={-1:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [i=9, p={-1:0}] [L10] i++ VAL [i=10, p={-1:0}] [L10] COND FALSE !(i < 10) [L14] free(p) VAL [p={-1:0}] [L14] free(p) VAL [p={-1:0}] [L14] free(p) [L16] p[2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 7]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 111 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 40, 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, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 24/342 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 22:23:52,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)