./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:34:00,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:34:00,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:34:00,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:34:00,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:34:00,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:34:00,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:34:00,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:34:00,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:34:00,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:34:00,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:34:00,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:34:00,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:34:00,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:34:00,153 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:34:00,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:34:00,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:34:00,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:34:00,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:34:00,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:34:00,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:34:00,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:34:00,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:34:00,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:34:00,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:00,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:34:00,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:34:00,158 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 [2025-02-05 14:34:00,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:34:00,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:34:00,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:34:00,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:34:00,385 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:34:00,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-2.i [2025-02-05 14:34:01,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b0fc5e9/27ab656f6dde4740aafd1a3520ed6ad1/FLAG7f6ba2e22 [2025-02-05 14:34:01,942 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:34:01,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-2.i [2025-02-05 14:34:01,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b0fc5e9/27ab656f6dde4740aafd1a3520ed6ad1/FLAG7f6ba2e22 [2025-02-05 14:34:01,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b0fc5e9/27ab656f6dde4740aafd1a3520ed6ad1 [2025-02-05 14:34:01,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:34:01,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:34:01,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:01,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:34:01,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:34:01,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:01" (1/1) ... [2025-02-05 14:34:01,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d441a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:01, skipping insertion in model container [2025-02-05 14:34:01,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:01" (1/1) ... [2025-02-05 14:34:02,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:34:02,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2025-02-05 14:34:02,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:02,187 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:34:02,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2025-02-05 14:34:02,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:02,235 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:34:02,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02 WrapperNode [2025-02-05 14:34:02,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:02,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:02,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:34:02,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:34:02,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,260 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2025-02-05 14:34:02,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:02,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:34:02,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:34:02,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:34:02,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,278 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 19 writes are split as follows [0, 19]. [2025-02-05 14:34:02,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:34:02,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:34:02,294 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:34:02,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:34:02,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (1/1) ... [2025-02-05 14:34:02,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:02,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:02,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:34:02,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:34:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:34:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:34:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:34:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:34:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:34:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:34:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:34:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:34:02,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:34:02,434 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:34:02,436 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:34:02,650 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 14:34:02,650 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:34:02,660 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:34:02,664 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:34:02,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:02 BoogieIcfgContainer [2025-02-05 14:34:02,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:34:02,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:34:02,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:34:02,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:34:02,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:34:01" (1/3) ... [2025-02-05 14:34:02,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaa4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:02, skipping insertion in model container [2025-02-05 14:34:02,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:02" (2/3) ... [2025-02-05 14:34:02,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaa4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:02, skipping insertion in model container [2025-02-05 14:34:02,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:02" (3/3) ... [2025-02-05 14:34:02,672 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2025-02-05 14:34:02,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:34:02,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-optional-2.i that has 1 procedures, 24 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:34:02,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:34:02,729 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=LoopHeads, 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;@3564967d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:34:02,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:34:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 14:34:02,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:02,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:02,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:34:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1511343964, now seen corresponding path program 1 times [2025-02-05 14:34:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827193851] [2025-02-05 14:34:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 14:34:02,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 14:34:02,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:02,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:02,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827193851] [2025-02-05 14:34:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827193851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:02,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:02,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:34:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971341726] [2025-02-05 14:34:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:02,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:34:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:02,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:34:02,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:34:02,935 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:02,942 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2025-02-05 14:34:02,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:34:02,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 14:34:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:02,947 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:34:02,947 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 14:34:02,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:34:02,950 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:02,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:34:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 14:34:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-05 14:34:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-02-05 14:34:02,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2025-02-05 14:34:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-05 14:34:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-02-05 14:34:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:34:02,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:02,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:34:02,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:34:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -187720326, now seen corresponding path program 1 times [2025-02-05 14:34:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528439464] [2025-02-05 14:34:02,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:34:03,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:34:03,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:03,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528439464] [2025-02-05 14:34:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528439464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:03,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:34:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541104409] [2025-02-05 14:34:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:34:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:03,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:34:03,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:34:03,302 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:03,445 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-02-05 14:34:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:34:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:34:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:03,446 INFO L225 Difference]: With dead ends: 46 [2025-02-05 14:34:03,446 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 14:34:03,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:34:03,447 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:03,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 51 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 14:34:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2025-02-05 14:34:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-02-05 14:34:03,455 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2025-02-05 14:34:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:03,456 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-05 14:34:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-02-05 14:34:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:34:03,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:03,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:34:03,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:34:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash -187721287, now seen corresponding path program 1 times [2025-02-05 14:34:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372922363] [2025-02-05 14:34:03,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:34:03,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:34:03,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:03,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:34:03,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:34:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:34:03,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:34:03,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:03,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:34:03,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:34:03,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:34:03,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:34:03,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:34:03,528 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 14:34:03,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:34:03,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:34:03 BoogieIcfgContainer [2025-02-05 14:34:03,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:34:03,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:34:03,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:34:03,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:34:03,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:02" (3/4) ... [2025-02-05 14:34:03,548 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 14:34:03,577 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-02-05 14:34:03,606 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:34:03,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:34:03,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:34:03,608 INFO L158 Benchmark]: Toolchain (without parser) took 1634.44ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 92.0MB in the end (delta: 30.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2025-02-05 14:34:03,609 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:03,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.93ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 104.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:34:03,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.75ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:03,611 INFO L158 Benchmark]: Boogie Preprocessor took 28.90ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:03,612 INFO L158 Benchmark]: IcfgBuilder took 371.30ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 84.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:34:03,612 INFO L158 Benchmark]: TraceAbstraction took 880.42ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 96.8MB in the end (delta: -13.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:03,612 INFO L158 Benchmark]: Witness Printer took 60.50ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 92.0MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:34:03,613 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.14ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.93ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 104.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.75ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.90ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 371.30ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 84.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 880.42ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 96.8MB in the end (delta: -13.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.50ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 92.0MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1009]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 2 [L1000] head->opt = malloc(sizeof(SLL)) [L1000] EXPR head->opt [L1000] head->opt->next = ((void*)0) [L1001] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1003] COND TRUE __VERIFIER_nondet_int() [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head VAL [head={-1:0}, x={-1:0}] [L1007] COND TRUE x != ((void*)0) [L1009] COND TRUE 0 [L1009] EXPR x->data [L1009] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}] [L1009] EXPR x->data == 2 && x->opt == x [L1009] EXPR x->opt [L1009] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}] [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] reach_error() VAL [head={-1:0}, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 46 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-05 14:34:03,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE