./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:35:21,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:35:21,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:35:21,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:35:21,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:35:21,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:35:21,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:35:21,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:35:21,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:35:21,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:35:21,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:35:21,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:35:21,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:35:21,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:35:21,209 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:35:21,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:35:21,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:21,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:35:21,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:35:21,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:35:21,212 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2025-02-06 10:35:21,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:35:21,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:35:21,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:35:21,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:35:21,415 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:35:21,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2025-02-06 10:35:22,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/433efd8ae/cc531e2b410f4069a3eb9a2f352865df/FLAG226398fb9 [2025-02-06 10:35:22,815 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:35:22,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2025-02-06 10:35:22,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/433efd8ae/cc531e2b410f4069a3eb9a2f352865df/FLAG226398fb9 [2025-02-06 10:35:22,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/433efd8ae/cc531e2b410f4069a3eb9a2f352865df [2025-02-06 10:35:22,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:35:22,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:35:22,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:22,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:35:22,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:35:22,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:22" (1/1) ... [2025-02-06 10:35:22,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d21bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:22, skipping insertion in model container [2025-02-06 10:35:22,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:22" (1/1) ... [2025-02-06 10:35:22,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:35:23,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:23,040 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:35:23,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:23,093 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:35:23,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23 WrapperNode [2025-02-06 10:35:23,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:23,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:23,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:35:23,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:35:23,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,123 INFO L138 Inliner]: procedures = 124, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-02-06 10:35:23,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:23,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:35:23,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:35:23,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:35:23,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,142 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-06 10:35:23,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:35:23,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:35:23,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:35:23,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:35:23,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (1/1) ... [2025-02-06 10:35:23,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:23,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:23,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:35:23,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:35:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:35:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:35:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:35:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:35:23,292 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:35:23,293 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:35:23,309 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:35:23,441 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-06 10:35:23,441 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:35:23,446 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:35:23,446 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:35:23,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:23 BoogieIcfgContainer [2025-02-06 10:35:23,446 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:35:23,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:35:23,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:35:23,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:35:23,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:35:22" (1/3) ... [2025-02-06 10:35:23,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2357ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:23, skipping insertion in model container [2025-02-06 10:35:23,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:23" (2/3) ... [2025-02-06 10:35:23,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2357ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:23, skipping insertion in model container [2025-02-06 10:35:23,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:23" (3/3) ... [2025-02-06 10:35:23,456 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-2.i [2025-02-06 10:35:23,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:35:23,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-2.i that has 2 procedures, 48 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-06 10:35:23,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:35:23,496 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;@65ba126b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:35:23,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 10:35:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:35:23,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:23,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:35:23,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1810945110, now seen corresponding path program 1 times [2025-02-06 10:35:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86745390] [2025-02-06 10:35:23,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:23,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:35:23,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:35:23,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86745390] [2025-02-06 10:35:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86745390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:23,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:23,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:35:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941929367] [2025-02-06 10:35:23,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:35:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:23,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:35:23,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:35:23,614 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:23,622 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-02-06 10:35:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:35:23,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:35:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:23,625 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:35:23,625 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:35:23,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:35:23,628 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:23,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:35:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:35:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 10:35:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-02-06 10:35:23,646 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 6 [2025-02-06 10:35:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:23,646 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-02-06 10:35:23,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-02-06 10:35:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:35:23,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:23,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:23,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:35:23,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:23,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash -304723984, now seen corresponding path program 1 times [2025-02-06 10:35:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797825169] [2025-02-06 10:35:23,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:23,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:35:23,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:35:23,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:23,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:23,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797825169] [2025-02-06 10:35:23,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797825169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:23,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:23,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184547734] [2025-02-06 10:35:23,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:23,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:23,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:23,745 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:23,818 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-06 10:35:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:23,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:35:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:23,819 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:35:23,819 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:35:23,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:23,820 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:23,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:35:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 10:35:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.6) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-02-06 10:35:23,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 7 [2025-02-06 10:35:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:23,824 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-02-06 10:35:23,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-02-06 10:35:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:35:23,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:23,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:23,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:35:23,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:23,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -304723983, now seen corresponding path program 1 times [2025-02-06 10:35:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054256898] [2025-02-06 10:35:23,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:23,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:35:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:35:23,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:23,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054256898] [2025-02-06 10:35:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054256898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780616206] [2025-02-06 10:35:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:23,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:23,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:23,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:23,939 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:24,038 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-06 10:35:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:35:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:24,039 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:35:24,040 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:35:24,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:24,040 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:24,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:35:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-02-06 10:35:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-06 10:35:24,044 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 7 [2025-02-06 10:35:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:24,044 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-06 10:35:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-06 10:35:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:35:24,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:24,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:24,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:35:24,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:24,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash 159252541, now seen corresponding path program 1 times [2025-02-06 10:35:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340260714] [2025-02-06 10:35:24,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:24,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:35:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:35:24,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:24,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340260714] [2025-02-06 10:35:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340260714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:35:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810674810] [2025-02-06 10:35:24,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:24,102 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:24,140 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-02-06 10:35:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:35:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:24,141 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:35:24,141 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:35:24,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:24,142 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:24,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 50 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:35:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:35:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-02-06 10:35:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2025-02-06 10:35:24,145 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2025-02-06 10:35:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2025-02-06 10:35:24,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2025-02-06 10:35:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:35:24,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:24,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:24,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:35:24,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1125627449, now seen corresponding path program 1 times [2025-02-06 10:35:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:24,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474063584] [2025-02-06 10:35:24,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:35:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:35:24,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474063584] [2025-02-06 10:35:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474063584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498536277] [2025-02-06 10:35:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:24,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:24,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:24,277 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:24,347 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2025-02-06 10:35:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:35:24,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:35:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:24,348 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:35:24,348 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:35:24,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:24,349 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:24,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 76 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:35:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:35:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2025-02-06 10:35:24,355 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 15 [2025-02-06 10:35:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:24,355 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2025-02-06 10:35:24,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2025-02-06 10:35:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:35:24,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:24,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:24,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:35:24,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1125627450, now seen corresponding path program 1 times [2025-02-06 10:35:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116564589] [2025-02-06 10:35:24,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:24,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:35:24,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:35:24,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:24,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:24,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:24,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116564589] [2025-02-06 10:35:24,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116564589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:24,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:24,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:24,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646076560] [2025-02-06 10:35:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:24,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:24,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:24,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:24,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:24,507 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:24,589 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-02-06 10:35:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:35:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:24,590 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:35:24,590 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:35:24,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:24,590 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:24,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:35:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2025-02-06 10:35:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-02-06 10:35:24,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 15 [2025-02-06 10:35:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:24,593 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-02-06 10:35:24,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-02-06 10:35:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:35:24,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:24,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:35:24,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:24,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash 973272249, now seen corresponding path program 1 times [2025-02-06 10:35:24,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:24,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418432776] [2025-02-06 10:35:24,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:24,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:35:24,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:35:24,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:24,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:24,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418432776] [2025-02-06 10:35:24,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418432776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:24,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:24,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:35:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354739345] [2025-02-06 10:35:24,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:24,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:35:24,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:24,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:35:24,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:35:24,702 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:24,771 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-06 10:35:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:24,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:35:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:24,772 INFO L225 Difference]: With dead ends: 56 [2025-02-06 10:35:24,772 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:35:24,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:35:24,772 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:24,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:35:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2025-02-06 10:35:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-02-06 10:35:24,777 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2025-02-06 10:35:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:24,777 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-02-06 10:35:24,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-02-06 10:35:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:35:24,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:24,778 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:24,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:35:24,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:24,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 107346452, now seen corresponding path program 1 times [2025-02-06 10:35:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681968977] [2025-02-06 10:35:24,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:24,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:24,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:24,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:24,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681968977] [2025-02-06 10:35:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681968977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:35:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930319338] [2025-02-06 10:35:24,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:24,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:24,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:24,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:24,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:35:25,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:25,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 10:35:25,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:25,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:35:25,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:35:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:25,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:35:25,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-02-06 10:35:25,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:35:25,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:35:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:25,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930319338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:35:25,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:35:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 14 [2025-02-06 10:35:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016371340] [2025-02-06 10:35:25,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:35:25,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:35:25,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:25,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:35:25,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:35:25,463 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:25,555 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-02-06 10:35:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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-02-06 10:35:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:25,556 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:35:25,556 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:35:25,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:35:25,556 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:25,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 130 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:35:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-02-06 10:35:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-02-06 10:35:25,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2025-02-06 10:35:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:25,558 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-02-06 10:35:25,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-02-06 10:35:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:35:25,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:25,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:25,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:35:25,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:25,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash 107345940, now seen corresponding path program 1 times [2025-02-06 10:35:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:25,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613873846] [2025-02-06 10:35:25,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:25,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:25,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:25,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 10:35:25,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 10:35:25,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:25,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:25,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:25,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 10:35:25,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 10:35:25,794 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 10:35:25,794 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2025-02-06 10:35:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-06 10:35:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-06 10:35:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-02-06 10:35:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-06 10:35:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-06 10:35:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-06 10:35:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-02-06 10:35:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:35:25,801 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:25,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:35:25,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:35:25 BoogieIcfgContainer [2025-02-06 10:35:25,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:35:25,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:35:25,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:35:25,817 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:35:25,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:23" (3/4) ... [2025-02-06 10:35:25,819 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 10:35:25,819 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:35:25,820 INFO L158 Benchmark]: Toolchain (without parser) took 2973.75ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 92.5MB in the end (delta: 19.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-02-06 10:35:25,820 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:25,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.82ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 94.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:35:25,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.40ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:25,821 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:25,821 INFO L158 Benchmark]: IcfgBuilder took 292.80ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 77.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:35:25,821 INFO L158 Benchmark]: TraceAbstraction took 2368.54ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 93.8MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:25,822 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 92.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:25,822 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.50ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.82ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 94.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.40ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 292.80ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 77.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2368.54ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 93.8MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 92.5MB in the end (delta: 27.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] p->h = 1 [L544] p->n = 0 [L545] p = a VAL [p={-1:0}] [L546] COND TRUE p!=0 [L547] EXPR p->h [L547] COND FALSE !(p->h != 1) [L550] EXPR p->n [L550] p = p->n [L546] COND FALSE !(p!=0) [L552] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 203 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=3, InterpolantAutomatonStates: 48, 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, 8 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 114 ConstructedInterpolants, 1 QuantifiedInterpolants, 847 SizeOfPredicates, 4 NumberOfNonLiveVariables, 98 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 9/12 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 could not prove your program: unable to determine feasibility of some traces [2025-02-06 10:35:25,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-properties/simple-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:35:27,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:35:27,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 10:35:27,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:35:27,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:35:27,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:35:27,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:35:27,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:35:27,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:35:27,634 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:35:27,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:35:27,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:35:27,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:35:27,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:35:27,635 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:35:27,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:35:27,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:35:27,637 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:35:27,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:27,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:35:27,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:35:27,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:35:27,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:35:27,639 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2025-02-06 10:35:27,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:35:27,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:35:27,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:35:27,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:35:27,870 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:35:27,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2025-02-06 10:35:28,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94c929493/ef694de5d426488d8ff81e9ac6e9cc07/FLAG443b4a71c [2025-02-06 10:35:29,217 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:35:29,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2025-02-06 10:35:29,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94c929493/ef694de5d426488d8ff81e9ac6e9cc07/FLAG443b4a71c [2025-02-06 10:35:29,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94c929493/ef694de5d426488d8ff81e9ac6e9cc07 [2025-02-06 10:35:29,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:35:29,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:35:29,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:29,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:35:29,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:35:29,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69950f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29, skipping insertion in model container [2025-02-06 10:35:29,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:35:29,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:29,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:35:29,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:29,808 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:35:29,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29 WrapperNode [2025-02-06 10:35:29,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:29,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:29,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:35:29,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:35:29,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,832 INFO L138 Inliner]: procedures = 127, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-02-06 10:35:29,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:29,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:35:29,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:35:29,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:35:29,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,854 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-06 10:35:29,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:35:29,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:35:29,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:35:29,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:35:29,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (1/1) ... [2025-02-06 10:35:29,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:29,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:35:29,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:35:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:35:29,923 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:35:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 10:35:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 10:35:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 10:35:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:35:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:35:29,999 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:35:30,001 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:35:30,019 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:35:30,204 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-06 10:35:30,205 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:35:30,210 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:35:30,211 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:35:30,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:30 BoogieIcfgContainer [2025-02-06 10:35:30,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:35:30,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:35:30,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:35:30,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:35:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:35:29" (1/3) ... [2025-02-06 10:35:30,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea7757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:30, skipping insertion in model container [2025-02-06 10:35:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:29" (2/3) ... [2025-02-06 10:35:30,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea7757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:30, skipping insertion in model container [2025-02-06 10:35:30,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:30" (3/3) ... [2025-02-06 10:35:30,218 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-2.i [2025-02-06 10:35:30,228 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:35:30,229 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-2.i that has 2 procedures, 48 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-06 10:35:30,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:35:30,259 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;@ea17dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:35:30,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 10:35:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:35:30,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:30,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:35:30,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1810945110, now seen corresponding path program 1 times [2025-02-06 10:35:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514354250] [2025-02-06 10:35:30,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:30,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:30,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:30,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:35:30,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:35:30,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:35:30,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:30,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 10:35:30,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:30,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:30,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514354250] [2025-02-06 10:35:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514354250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:35:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449659645] [2025-02-06 10:35:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:30,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:35:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:30,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:35:30,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:35:30,391 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:30,402 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-02-06 10:35:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:35:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:35:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:30,406 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:35:30,406 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:35:30,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:35:30,411 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:35:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:35:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 10:35:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-02-06 10:35:30,438 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 6 [2025-02-06 10:35:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:30,438 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-02-06 10:35:30,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-02-06 10:35:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:35:30,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:30,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:30,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:35:30,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:30,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:30,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash -304723984, now seen corresponding path program 1 times [2025-02-06 10:35:30,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:30,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390259552] [2025-02-06 10:35:30,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:30,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:30,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:35:30,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:35:30,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:35:30,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:30,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:30,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:35:30,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:30,736 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 6 treesize of output 7 [2025-02-06 10:35:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:30,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:30,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:30,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390259552] [2025-02-06 10:35:30,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390259552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:30,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:30,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473544281] [2025-02-06 10:35:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:30,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:30,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:30,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:30,775 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:30,875 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-06 10:35:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:35:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:30,876 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:35:30,876 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:35:30,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:30,876 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:30,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:35:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 10:35:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.6) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-02-06 10:35:30,881 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 7 [2025-02-06 10:35:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:30,881 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-02-06 10:35:30,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-02-06 10:35:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:35:30,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:30,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:30,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:35:31,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:31,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:31,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash -304723983, now seen corresponding path program 1 times [2025-02-06 10:35:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:31,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657403315] [2025-02-06 10:35:31,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:31,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:31,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:31,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:35:31,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:35:31,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:35:31,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:31,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:31,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:35:31,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:31,139 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 6 treesize of output 5 [2025-02-06 10:35:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:31,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:31,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657403315] [2025-02-06 10:35:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657403315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:31,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113792525] [2025-02-06 10:35:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:31,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:31,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:31,181 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:31,300 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-06 10:35:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:35:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:31,302 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:35:31,302 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:35:31,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:31,303 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:31,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:35:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-02-06 10:35:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-06 10:35:31,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 7 [2025-02-06 10:35:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:31,310 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-06 10:35:31,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-06 10:35:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:35:31,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:31,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:31,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:35:31,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:31,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:31,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash 159252541, now seen corresponding path program 1 times [2025-02-06 10:35:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425987497] [2025-02-06 10:35:31,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:31,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:31,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:31,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:31,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:35:31,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:35:31,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:35:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:31,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:35:31,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:31,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:31,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425987497] [2025-02-06 10:35:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425987497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:35:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539043940] [2025-02-06 10:35:31,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:31,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:31,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:31,575 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:31,640 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-02-06 10:35:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:31,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:35:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:31,641 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:35:31,641 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:35:31,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:31,642 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:31,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 50 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:35:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-02-06 10:35:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2025-02-06 10:35:31,645 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2025-02-06 10:35:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:31,645 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2025-02-06 10:35:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2025-02-06 10:35:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:35:31,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:31,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:31,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:35:31,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:31,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:31,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1125627449, now seen corresponding path program 1 times [2025-02-06 10:35:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780799412] [2025-02-06 10:35:31,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:31,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:31,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:31,852 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:31,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:35:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:35:31,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:35:31,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:31,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 10:35:31,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:31,923 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 6 treesize of output 7 [2025-02-06 10:35:31,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:35:31,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:35:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:31,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:31,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:31,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780799412] [2025-02-06 10:35:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780799412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:31,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:31,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218262080] [2025-02-06 10:35:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:31,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:31,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:31,981 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:32,106 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2025-02-06 10:35:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:35:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:35:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:32,107 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:35:32,107 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:35:32,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:32,107 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:32,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 76 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:35:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:35:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2025-02-06 10:35:32,110 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 15 [2025-02-06 10:35:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:32,110 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2025-02-06 10:35:32,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2025-02-06 10:35:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:35:32,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:32,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:32,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:35:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:32,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:32,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1125627450, now seen corresponding path program 1 times [2025-02-06 10:35:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772282218] [2025-02-06 10:35:32,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:32,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:32,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:32,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:35:32,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:35:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:35:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:32,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:35:32,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:32,368 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 6 treesize of output 5 [2025-02-06 10:35:32,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:35:32,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:35:32,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 10:35:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:32,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:32,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772282218] [2025-02-06 10:35:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772282218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:32,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:32,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908096235] [2025-02-06 10:35:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:32,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:32,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:32,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:32,470 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:32,629 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-02-06 10:35:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:35:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:32,630 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:35:32,630 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:35:32,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:32,632 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:32,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:35:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2025-02-06 10:35:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-02-06 10:35:32,635 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 15 [2025-02-06 10:35:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:32,635 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-02-06 10:35:32,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-02-06 10:35:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:35:32,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:32,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:32,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:35:32,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:32,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:32,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash 973272249, now seen corresponding path program 1 times [2025-02-06 10:35:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876467417] [2025-02-06 10:35:32,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:32,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:32,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:32,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:32,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:35:32,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:35:32,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:35:32,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:32,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:32,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 10:35:32,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:32,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:35:32,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:35:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:32,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:35:32,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876467417] [2025-02-06 10:35:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876467417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:32,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:35:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250390408] [2025-02-06 10:35:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:35:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:32,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:35:32,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:35:32,968 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:33,102 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-06 10:35:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:35:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:33,103 INFO L225 Difference]: With dead ends: 56 [2025-02-06 10:35:33,103 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:35:33,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:35:33,103 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:33,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:35:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2025-02-06 10:35:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-02-06 10:35:33,105 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2025-02-06 10:35:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:33,105 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-02-06 10:35:33,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-02-06 10:35:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:35:33,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:33,106 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:33,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:35:33,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:33,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:33,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash 107346452, now seen corresponding path program 1 times [2025-02-06 10:35:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67722060] [2025-02-06 10:35:33,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:33,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:33,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:35:33,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:33,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:33,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:33,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:33,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:35:33,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:33,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:35:33,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:35:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:33,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:35:33,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-02-06 10:35:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:35:33,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:35:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:33,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:35:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67722060] [2025-02-06 10:35:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67722060] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:35:33,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:35:33,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-02-06 10:35:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907119392] [2025-02-06 10:35:33,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:35:33,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:35:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:35:33,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:35:33,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:35:33,610 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:33,732 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-02-06 10:35:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:33,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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) Word has length 16 [2025-02-06 10:35:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:33,733 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:35:33,733 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:35:33,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:35:33,737 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:33,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 107 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:35:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-02-06 10:35:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-02-06 10:35:33,739 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2025-02-06 10:35:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:33,739 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-02-06 10:35:33,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-02-06 10:35:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:35:33,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:33,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:33,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:35:33,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:33,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-06 10:35:33,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash 107345940, now seen corresponding path program 1 times [2025-02-06 10:35:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:35:33,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281473682] [2025-02-06 10:35:33,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:33,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:33,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:35:33,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:34,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:34,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:34,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 10:35:34,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 10:35:34,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:35:34,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:35:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 10:35:34,038 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 10:35:34,039 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 10:35:34,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-02-06 10:35:34,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-06 10:35:34,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-02-06 10:35:34,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:35:34,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:34,244 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:34,256 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:35:34,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:35:34 BoogieIcfgContainer [2025-02-06 10:35:34,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:35:34,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:35:34,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:35:34,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:35:34,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:30" (3/4) ... [2025-02-06 10:35:34,261 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 10:35:34,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:35:34,262 INFO L158 Benchmark]: Toolchain (without parser) took 4707.42ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 81.9MB in the end (delta: 9.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.73ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.65ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 72.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: Boogie Preprocessor took 38.06ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 70.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: IcfgBuilder took 339.33ms. Allocated memory is still 117.4MB. Free memory was 70.2MB in the beginning and 53.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: TraceAbstraction took 4044.59ms. Allocated memory is still 117.4MB. Free memory was 53.0MB in the beginning and 81.9MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:34,262 INFO L158 Benchmark]: Witness Printer took 2.41ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:35:34,263 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.73ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.65ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 72.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.06ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 70.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 339.33ms. Allocated memory is still 117.4MB. Free memory was 70.2MB in the beginning and 53.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4044.59ms. Allocated memory is still 117.4MB. Free memory was 53.0MB in the beginning and 81.9MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.41ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={3:0}] [L534] List t; [L535] List p = a; VAL [a={3:0}, p={3:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] p->h = 1 [L544] p->n = 0 [L545] p = a VAL [p={3:0}] [L546] COND TRUE p!=0 [L547] EXPR p->h [L547] COND FALSE !(p->h != 1) [L550] EXPR p->n [L550] p = p->n [L546] COND FALSE !(p!=0) [L552] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 527 IncrementalHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 203 mSDtfsCounter, 527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=3, InterpolantAutomatonStates: 48, 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, 8 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 13 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 8/10 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 could not prove your program: unable to determine feasibility of some traces [2025-02-06 10:35:34,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample