./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ce057761c66e7025e367ba93d275e71dea4e6dc273a0ba7c5cecd0f774a5d453 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:42:11,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:42:11,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 22:42:11,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:42:11,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:42:11,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:42:11,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:42:11,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:42:11,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:42:11,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:42:11,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:42:11,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:42:11,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:42:11,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:42:11,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:42:11,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:42:11,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:42:11,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:42:11,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:42:11,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:42:11,155 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:42:11,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:42:11,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:42:11,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:42:11,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:42:11,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:42:11,157 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/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 -> ce057761c66e7025e367ba93d275e71dea4e6dc273a0ba7c5cecd0f774a5d453 [2025-03-08 22:42:11,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:42:11,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:42:11,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:42:11,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:42:11,382 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:42:11,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i [2025-03-08 22:42:12,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5b25c6a/888df2035d63402ea57e72347d7e2884/FLAG284f461a2 [2025-03-08 22:42:12,744 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:42:12,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i [2025-03-08 22:42:12,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5b25c6a/888df2035d63402ea57e72347d7e2884/FLAG284f461a2 [2025-03-08 22:42:13,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5b25c6a/888df2035d63402ea57e72347d7e2884 [2025-03-08 22:42:13,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:42:13,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:42:13,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:42:13,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:42:13,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:42:13,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6807de3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13, skipping insertion in model container [2025-03-08 22:42:13,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:42:13,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:42:13,272 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:42:13,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:42:13,315 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:42:13,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13 WrapperNode [2025-03-08 22:42:13,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:42:13,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:42:13,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:42:13,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:42:13,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,340 INFO L138 Inliner]: procedures = 111, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-08 22:42:13,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:42:13,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:42:13,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:42:13,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:42:13,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,362 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 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-03-08 22:42:13,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:42:13,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:42:13,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:42:13,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:42:13,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (1/1) ... [2025-03-08 22:42:13,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:42:13,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:42:13,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:42:13,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:42:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:42:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:42:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:42:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:42:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:42:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:42:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:42:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:42:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:42:13,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:42:13,508 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:42:13,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:42:13,645 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;havoc main_#t~ret12#1; [2025-03-08 22:42:13,645 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc test_fun_#t~mem9#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-08 22:42:13,655 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-08 22:42:13,655 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:42:13,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:42:13,661 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:42:13,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:42:13 BoogieIcfgContainer [2025-03-08 22:42:13,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:42:13,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:42:13,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:42:13,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:42:13,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:42:13" (1/3) ... [2025-03-08 22:42:13,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c04c859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:42:13, skipping insertion in model container [2025-03-08 22:42:13,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:13" (2/3) ... [2025-03-08 22:42:13,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c04c859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:42:13, skipping insertion in model container [2025-03-08 22:42:13,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:42:13" (3/3) ... [2025-03-08 22:42:13,670 INFO L128 eAbstractionObserver]: Analyzing ICFG b.16-alloca.i [2025-03-08 22:42:13,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:42:13,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.16-alloca.i that has 1 procedures, 42 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-03-08 22:42:13,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:42:13,722 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;@377de2de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:42:13,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-08 22:42:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 20 states have (on average 2.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:42:13,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:13,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:42:13,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:13,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash 76428, now seen corresponding path program 1 times [2025-03-08 22:42:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175676246] [2025-03-08 22:42:13,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:13,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:42:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:42:13,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:13,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175676246] [2025-03-08 22:42:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175676246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060583400] [2025-03-08 22:42:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:14,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:14,106 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 2.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03-08 22:42:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,158 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-03-08 22:42:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:14,160 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-03-08 22:42:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,164 INFO L225 Difference]: With dead ends: 38 [2025-03-08 22:42:14,164 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 22:42:14,166 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-03-08 22:42:14,169 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 22:42:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 22:42:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 35 states have internal predecessors, (37), 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-03-08 22:42:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-08 22:42:14,196 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 3 [2025-03-08 22:42:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,196 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-08 22:42:14,196 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-03-08 22:42:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-08 22:42:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:42:14,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:14,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:42:14,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:42:14,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:14,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash 76429, now seen corresponding path program 1 times [2025-03-08 22:42:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966566756] [2025-03-08 22:42:14,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:14,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:42:14,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:42:14,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:14,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966566756] [2025-03-08 22:42:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966566756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739216022] [2025-03-08 22:42:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:14,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:14,360 INFO L87 Difference]: Start difference. First operand 36 states and 37 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-03-08 22:42:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,388 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2025-03-08 22:42:14,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:14,388 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-03-08 22:42:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,388 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:42:14,388 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 22:42:14,389 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-03-08 22:42:14,390 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 22:42:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 22:42:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.736842105263158) internal successors, (33), 31 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-03-08 22:42:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-08 22:42:14,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 3 [2025-03-08 22:42:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-08 22:42:14,393 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-03-08 22:42:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-08 22:42:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:42:14,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:14,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:42:14,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:42:14,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2369278, now seen corresponding path program 1 times [2025-03-08 22:42:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410740672] [2025-03-08 22:42:14,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:14,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:42:14,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:42:14,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:14,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410740672] [2025-03-08 22:42:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410740672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809594295] [2025-03-08 22:42:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:14,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:14,463 INFO L87 Difference]: Start difference. First operand 32 states and 33 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-03-08 22:42:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,493 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-03-08 22:42:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:14,494 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-03-08 22:42:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,494 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:42:14,494 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 22:42:14,494 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-03-08 22:42:14,495 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 22:42:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 22:42:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 27 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-03-08 22:42:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-08 22:42:14,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2025-03-08 22:42:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,496 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-08 22:42:14,496 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-03-08 22:42:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-08 22:42:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:42:14,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:14,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:42:14,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:42:14,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2369279, now seen corresponding path program 1 times [2025-03-08 22:42:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156152591] [2025-03-08 22:42:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:14,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:42:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:42:14,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156152591] [2025-03-08 22:42:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156152591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186647720] [2025-03-08 22:42:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:14,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:14,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:14,563 INFO L87 Difference]: Start difference. First operand 28 states and 29 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-03-08 22:42:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,589 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-08 22:42:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:14,589 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-03-08 22:42:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,590 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:42:14,590 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 22:42:14,590 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-03-08 22:42:14,591 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 22:42:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 22:42:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-08 22:42:14,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 4 [2025-03-08 22:42:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,596 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-08 22:42:14,596 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-03-08 22:42:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-08 22:42:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:42:14,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:14,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:42:14,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:42:14,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:14,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash 73447625, now seen corresponding path program 1 times [2025-03-08 22:42:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:14,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484237658] [2025-03-08 22:42:14,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:14,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:42:14,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:42:14,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:14,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484237658] [2025-03-08 22:42:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484237658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787676392] [2025-03-08 22:42:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:14,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:14,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:14,646 INFO L87 Difference]: Start difference. First operand 24 states and 25 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-03-08 22:42:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,671 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-03-08 22:42:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:14,671 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-03-08 22:42:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,672 INFO L225 Difference]: With dead ends: 22 [2025-03-08 22:42:14,672 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 22:42:14,673 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-03-08 22:42:14,673 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 22:42:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 22:42:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-08 22:42:14,677 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 5 [2025-03-08 22:42:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,677 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-08 22:42:14,677 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-03-08 22:42:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-08 22:42:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:42:14,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:14,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:42:14,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:42:14,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:14,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash 73447626, now seen corresponding path program 1 times [2025-03-08 22:42:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:14,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841522404] [2025-03-08 22:42:14,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:14,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:42:14,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:42:14,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841522404] [2025-03-08 22:42:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841522404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731074446] [2025-03-08 22:42:14,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:14,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:14,749 INFO L87 Difference]: Start difference. First operand 22 states and 23 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-03-08 22:42:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,763 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-03-08 22:42:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:14,764 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-03-08 22:42:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,764 INFO L225 Difference]: With dead ends: 20 [2025-03-08 22:42:14,764 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 22:42:14,764 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-03-08 22:42:14,765 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 22:42:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 22:42:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-03-08 22:42:14,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2025-03-08 22:42:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,768 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-08 22:42:14,768 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-03-08 22:42:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-03-08 22:42:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:42:14,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:14,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:14,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:42:14,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-03-08 22:42:14,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1156291875, now seen corresponding path program 1 times [2025-03-08 22:42:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:14,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007244263] [2025-03-08 22:42:14,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:14,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:42:14,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:42:14,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:14,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007244263] [2025-03-08 22:42:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007244263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:42:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595766891] [2025-03-08 22:42:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:42:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:14,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:42:14,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:14,949 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:14,974 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-03-08 22:42:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:42:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:42:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:14,976 INFO L225 Difference]: With dead ends: 19 [2025-03-08 22:42:14,976 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:42:14,976 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-03-08 22:42:14,977 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:14,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:42:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:42:14,977 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-03-08 22:42:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:42:14,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-03-08 22:42:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:42:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:42:14,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:42:14,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2025-03-08 22:42:14,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2025-03-08 22:42:14,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2025-03-08 22:42:14,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2025-03-08 22:42:14,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2025-03-08 22:42:14,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2025-03-08 22:42:14,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2025-03-08 22:42:14,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2025-03-08 22:42:14,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2025-03-08 22:42:14,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2025-03-08 22:42:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2025-03-08 22:42:14,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2025-03-08 22:42:14,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:42:14,987 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:14,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:42:14,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:42:14 BoogieIcfgContainer [2025-03-08 22:42:14,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:42:14,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:42:14,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:42:14,992 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:42:14,993 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:42:13" (3/4) ... [2025-03-08 22:42:14,994 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:42:15,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 22:42:15,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:42:15,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:42:15,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:42:15,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:42:15,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:42:15,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:42:15,063 INFO L158 Benchmark]: Toolchain (without parser) took 2001.25ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 75.2MB in the end (delta: 35.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-03-08 22:42:15,064 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:42:15,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.20ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 94.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:42:15,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.64ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:42:15,064 INFO L158 Benchmark]: Boogie Preprocessor took 35.02ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:42:15,064 INFO L158 Benchmark]: IcfgBuilder took 285.23ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 76.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:42:15,065 INFO L158 Benchmark]: TraceAbstraction took 1327.98ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 81.6MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:42:15,066 INFO L158 Benchmark]: Witness Printer took 69.23ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 75.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:42:15,066 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 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.20ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 94.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.64ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.02ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 285.23ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 76.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1327.98ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 81.6MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.23ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 75.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 563]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 45 edges, 21 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 91 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:42:15,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE