./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f1855ccd5ef0c8491e97368f082ce5aab941ff0c5bf681c3496fd6584d783f6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:11:59,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:11:59,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:11:59,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:11:59,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:11:59,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:11:59,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:11:59,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:11:59,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:11:59,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:11:59,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:11:59,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:11:59,093 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:11:59,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:11:59,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:11:59,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:11:59,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:11:59,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1855ccd5ef0c8491e97368f082ce5aab941ff0c5bf681c3496fd6584d783f6d [2025-01-09 22:11:59,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:11:59,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:11:59,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:11:59,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:11:59,334 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:11:59,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2025-01-09 22:12:00,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f0f99e0e/ba43adb9a48c44808bfb96db50e15b0e/FLAG8e333178b [2025-01-09 22:12:00,678 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:12:00,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2025-01-09 22:12:00,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f0f99e0e/ba43adb9a48c44808bfb96db50e15b0e/FLAG8e333178b [2025-01-09 22:12:01,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f0f99e0e/ba43adb9a48c44808bfb96db50e15b0e [2025-01-09 22:12:01,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:12:01,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:12:01,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:12:01,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:12:01,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:12:01,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b402369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01, skipping insertion in model container [2025-01-09 22:12:01,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:12:01,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:12:01,209 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:12:01,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:12:01,261 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:12:01,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01 WrapperNode [2025-01-09 22:12:01,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:12:01,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:12:01,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:12:01,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:12:01,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,287 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-01-09 22:12:01,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:12:01,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:12:01,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:12:01,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:12:01,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,310 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2025-01-09 22:12:01,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:12:01,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:12:01,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:12:01,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:12:01,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (1/1) ... [2025-01-09 22:12:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:01,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:12:01,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:12:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:12:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:12:01,443 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:12:01,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:12:01,577 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-01-09 22:12:01,577 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:12:01,584 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:12:01,585 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:12:01,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:01 BoogieIcfgContainer [2025-01-09 22:12:01,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:12:01,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:12:01,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:12:01,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:12:01,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:12:01" (1/3) ... [2025-01-09 22:12:01,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301c71d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:12:01, skipping insertion in model container [2025-01-09 22:12:01,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:01" (2/3) ... [2025-01-09 22:12:01,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301c71d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:12:01, skipping insertion in model container [2025-01-09 22:12:01,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:01" (3/3) ... [2025-01-09 22:12:01,594 INFO L128 eAbstractionObserver]: Analyzing ICFG b.12-alloca.i [2025-01-09 22:12:01,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:12:01,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.12-alloca.i that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 25 error locations. [2025-01-09 22:12:01,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:12:01,646 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;@5470042d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:12:01,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 22:12:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:12:01,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:01,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:12:01,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-01-09 22:12:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164736067] [2025-01-09 22:12:01,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:01,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:12:01,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:12:01,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:01,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164736067] [2025-01-09 22:12:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164736067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370123243] [2025-01-09 22:12:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:01,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:01,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:01,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:01,939 INFO L87 Difference]: Start difference. First operand has 52 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,007 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2025-01-09 22:12:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-01-09 22:12:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,015 INFO L225 Difference]: With dead ends: 47 [2025-01-09 22:12:02,016 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:12:02,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,019 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 26 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:12:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 22:12:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.92) internal successors, (48), 44 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-01-09 22:12:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-01-09 22:12:02,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 3 [2025-01-09 22:12:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,041 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-01-09 22:12:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-01-09 22:12:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:12:02,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:12:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:12:02,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-01-09 22:12:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113881713] [2025-01-09 22:12:02,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:12:02,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:12:02,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113881713] [2025-01-09 22:12:02,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113881713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311981717] [2025-01-09 22:12:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:02,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:02,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,200 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,238 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2025-01-09 22:12:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-01-09 22:12:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,239 INFO L225 Difference]: With dead ends: 40 [2025-01-09 22:12:02,239 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 22:12:02,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,240 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 26 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 22:12:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 22:12:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-01-09 22:12:02,242 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 3 [2025-01-09 22:12:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,242 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-01-09 22:12:02,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-01-09 22:12:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:12:02,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:12:02,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:12:02,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2025-01-09 22:12:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174975335] [2025-01-09 22:12:02,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:12:02,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:12:02,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174975335] [2025-01-09 22:12:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174975335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526750931] [2025-01-09 22:12:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:02,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,315 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,356 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-01-09 22:12:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:12:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,357 INFO L225 Difference]: With dead ends: 35 [2025-01-09 22:12:02,357 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 22:12:02,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,358 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 22:12:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 22:12:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.52) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-01-09 22:12:02,360 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 4 [2025-01-09 22:12:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,360 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-01-09 22:12:02,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-01-09 22:12:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:12:02,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:12:02,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:12:02,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2025-01-09 22:12:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311642319] [2025-01-09 22:12:02,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:12:02,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:12:02,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311642319] [2025-01-09 22:12:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311642319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783167194] [2025-01-09 22:12:02,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:02,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,440 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,469 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-01-09 22:12:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:12:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,471 INFO L225 Difference]: With dead ends: 30 [2025-01-09 22:12:02,471 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 22:12:02,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,471 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 22:12:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 22:12:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-01-09 22:12:02,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 4 [2025-01-09 22:12:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,473 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-01-09 22:12:02,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-01-09 22:12:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:12:02,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:12:02,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:12:02,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2025-01-09 22:12:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401634707] [2025-01-09 22:12:02,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:12:02,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:12:02,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401634707] [2025-01-09 22:12:02,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401634707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732167813] [2025-01-09 22:12:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:02,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,511 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,539 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-01-09 22:12:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-09 22:12:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,541 INFO L225 Difference]: With dead ends: 28 [2025-01-09 22:12:02,541 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 22:12:02,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,541 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 22:12:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 22:12:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-01-09 22:12:02,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 5 [2025-01-09 22:12:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-01-09 22:12:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-01-09 22:12:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:12:02,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:12:02,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:12:02,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2025-01-09 22:12:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799698271] [2025-01-09 22:12:02,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:12:02,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:12:02,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799698271] [2025-01-09 22:12:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799698271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361272094] [2025-01-09 22:12:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:02,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,604 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,624 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-01-09 22:12:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-09 22:12:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,626 INFO L225 Difference]: With dead ends: 26 [2025-01-09 22:12:02,626 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 22:12:02,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,626 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 20 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 22:12:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 22:12:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-01-09 22:12:02,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2025-01-09 22:12:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,628 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-01-09 22:12:02,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-01-09 22:12:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:12:02,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:12:02,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1808218153, now seen corresponding path program 1 times [2025-01-09 22:12:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390316785] [2025-01-09 22:12:02,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:12:02,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:12:02,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390316785] [2025-01-09 22:12:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390316785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:12:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902964915] [2025-01-09 22:12:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:02,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,668 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,676 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-01-09 22:12:02,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:02,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:12:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,676 INFO L225 Difference]: With dead ends: 27 [2025-01-09 22:12:02,677 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 22:12:02,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:02,677 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 22:12:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 22:12:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-01-09 22:12:02,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2025-01-09 22:12:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,680 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-01-09 22:12:02,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-01-09 22:12:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:12:02,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:02,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:02,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:12:02,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-09 22:12:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash 318572594, now seen corresponding path program 1 times [2025-01-09 22:12:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056559746] [2025-01-09 22:12:02,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:02,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:12:02,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:12:02,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:02,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:02,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056559746] [2025-01-09 22:12:02,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056559746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:02,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:12:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084197308] [2025-01-09 22:12:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:02,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:12:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:02,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:12:02,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:02,860 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:02,891 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-01-09 22:12:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:12:02,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:12:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:02,892 INFO L225 Difference]: With dead ends: 26 [2025-01-09 22:12:02,892 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:12:02,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:02,893 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:02,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:12:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:12:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:12:02,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2025-01-09 22:12:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:02,893 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:12:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:12:02,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:12:02,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2025-01-09 22:12:02,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2025-01-09 22:12:02,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2025-01-09 22:12:02,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 25 remaining) [2025-01-09 22:12:02,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 25 remaining) [2025-01-09 22:12:02,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 25 remaining) [2025-01-09 22:12:02,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 25 remaining) [2025-01-09 22:12:02,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:12:02,903 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:02,905 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:12:02,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:12:02 BoogieIcfgContainer [2025-01-09 22:12:02,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:12:02,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:12:02,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:12:02,909 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:12:02,909 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:01" (3/4) ... [2025-01-09 22:12:02,911 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:12:02,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 22:12:02,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 22:12:02,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 22:12:02,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:12:02,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:12:02,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:12:02,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:12:02,980 INFO L158 Benchmark]: Toolchain (without parser) took 1954.41ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 64.3MB in the end (delta: 48.7MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2025-01-09 22:12:02,980 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:02,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.43ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 96.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:12:02,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.94ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:02,981 INFO L158 Benchmark]: Boogie Preprocessor took 35.05ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:02,982 INFO L158 Benchmark]: RCFGBuilder took 261.40ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 77.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:12:02,982 INFO L158 Benchmark]: TraceAbstraction took 1320.89ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 70.6MB in the end (delta: 6.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-01-09 22:12:02,982 INFO L158 Benchmark]: Witness Printer took 70.15ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 64.3MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:12:02,983 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.43ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 96.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.94ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.05ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 261.40ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 77.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1320.89ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 70.6MB in the end (delta: 6.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Witness Printer took 70.15ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 64.3MB in the end (delta: 6.3MB). 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 163 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:12:02,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE