./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/splice-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/splice-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3368805c1b8fd734b0faf0a6dc34f33a5f2dfc4632d20a018a29950383fb6a5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:22:17,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:22:17,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:22:17,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:22:17,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:22:17,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:22:17,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:22:17,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:22:17,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:22:17,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:22:17,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:22:17,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:22:17,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:22:17,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:22:17,252 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:22:17,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:22:17,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:22:17,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:22:17,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:22:17,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:22:17,255 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 ! 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 -> 3368805c1b8fd734b0faf0a6dc34f33a5f2dfc4632d20a018a29950383fb6a5c [2025-03-03 13:22:17,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:22:17,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:22:17,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:22:17,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:22:17,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:22:17,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/splice-1.i [2025-03-03 13:22:18,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edec94183/722e42de5f3249b8b4c5f0dbbcca0b51/FLAG5fffc1688 [2025-03-03 13:22:19,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:22:19,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-1.i [2025-03-03 13:22:19,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edec94183/722e42de5f3249b8b4c5f0dbbcca0b51/FLAG5fffc1688 [2025-03-03 13:22:19,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edec94183/722e42de5f3249b8b4c5f0dbbcca0b51 [2025-03-03 13:22:19,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:22:19,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:22:19,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:22:19,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:22:19,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:22:19,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19, skipping insertion in model container [2025-03-03 13:22:19,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:22:19,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-1.i[23721,23734] [2025-03-03 13:22:19,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:22:19,332 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:22:19,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-1.i[23721,23734] [2025-03-03 13:22:19,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:22:19,395 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:22:19,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19 WrapperNode [2025-03-03 13:22:19,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:22:19,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:22:19,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:22:19,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:22:19,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,430 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 96 [2025-03-03 13:22:19,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:22:19,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:22:19,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:22:19,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:22:19,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,456 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-03 13:22:19,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:22:19,469 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:22:19,469 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:22:19,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:22:19,470 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (1/1) ... [2025-03-03 13:22:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:22:19,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:19,497 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-03 13:22:19,501 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-03 13:22:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-03 13:22:19,517 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:22:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:22:19,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:22:19,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:22:19,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-03 13:22:19,760 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 13:22:19,761 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:22:19,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:22:19,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:22:19,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:19 BoogieIcfgContainer [2025-03-03 13:22:19,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:22:19,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:22:19,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:22:19,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:22:19,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:22:19" (1/3) ... [2025-03-03 13:22:19,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab13bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:22:19, skipping insertion in model container [2025-03-03 13:22:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:19" (2/3) ... [2025-03-03 13:22:19,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab13bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:22:19, skipping insertion in model container [2025-03-03 13:22:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:19" (3/3) ... [2025-03-03 13:22:19,774 INFO L128 eAbstractionObserver]: Analyzing ICFG splice-1.i [2025-03-03 13:22:19,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:22:19,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG splice-1.i that has 2 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:22:19,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:22:19,825 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;@15426223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:22:19,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:22:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:22:19,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:19,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:19,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:19,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:19,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1073334624, now seen corresponding path program 1 times [2025-03-03 13:22:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793646219] [2025-03-03 13:22:19,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:19,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:22:19,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:22:19,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:19,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:19,954 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-03 13:22:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793646219] [2025-03-03 13:22:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793646219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:22:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123002886] [2025-03-03 13:22:19,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:19,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:22:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:19,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:22:19,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:22:19,972 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.56) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-03-03 13:22:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:19,986 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2025-03-03 13:22:19,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:22:19,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-03-03 13:22:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:19,990 INFO L225 Difference]: With dead ends: 44 [2025-03-03 13:22:19,990 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:22:19,992 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-03-03 13:22:19,994 INFO L435 NwaCegarLoop]: 38 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, 38 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-03-03 13:22:19,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:22:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 13:22:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-03 13:22:20,013 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2025-03-03 13:22:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-03 13:22:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-03-03 13:22:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-03 13:22:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:22:20,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:20,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:20,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:22:20,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:20,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1776656596, now seen corresponding path program 1 times [2025-03-03 13:22:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:20,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339174076] [2025-03-03 13:22:20,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:20,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:22:20,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:22:20,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:20,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:20,193 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-03 13:22:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339174076] [2025-03-03 13:22:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339174076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:22:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183279210] [2025-03-03 13:22:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:20,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:22:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:20,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:22:20,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:22:20,196 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03 13:22:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:20,240 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2025-03-03 13:22:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:22:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 13:22:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:20,241 INFO L225 Difference]: With dead ends: 33 [2025-03-03 13:22:20,241 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 13:22:20,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 13:22:20,242 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:20,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 13:22:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 13:22:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-03 13:22:20,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-03-03 13:22:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:20,246 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-03 13:22:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03 13:22:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-03 13:22:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:22:20,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:20,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:20,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:22:20,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:20,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 758037944, now seen corresponding path program 1 times [2025-03-03 13:22:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:20,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498286723] [2025-03-03 13:22:20,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:20,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:22:20,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:22:20,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:20,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:20,334 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-03 13:22:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498286723] [2025-03-03 13:22:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498286723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:22:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371812980] [2025-03-03 13:22:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:20,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:22:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:20,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:22:20,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:22:20,336 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:20,366 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-03-03 13:22:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:22:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:22:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:20,368 INFO L225 Difference]: With dead ends: 45 [2025-03-03 13:22:20,368 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:22:20,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 13:22:20,369 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:20,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:22:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-03 13:22:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-03-03 13:22:20,373 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 15 [2025-03-03 13:22:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:20,373 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-03-03 13:22:20,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-03-03 13:22:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:22:20,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:20,374 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:22:20,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1373494479, now seen corresponding path program 1 times [2025-03-03 13:22:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586306854] [2025-03-03 13:22:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:20,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:22:20,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:22:20,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:20,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:20,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:20,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586306854] [2025-03-03 13:22:20,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586306854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:20,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:22:20,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295212719] [2025-03-03 13:22:20,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:20,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:22:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:20,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:22:20,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:22:20,586 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03 13:22:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:20,683 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-03 13:22:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:22:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-03 13:22:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:20,685 INFO L225 Difference]: With dead ends: 68 [2025-03-03 13:22:20,685 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 13:22:20,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:22:20,686 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:20,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:22:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 13:22:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-03-03 13:22:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-03-03 13:22:20,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 17 [2025-03-03 13:22:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:20,692 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-03 13:22:20,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03 13:22:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-03-03 13:22:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:22:20,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:20,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:22:20,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2065315019, now seen corresponding path program 1 times [2025-03-03 13:22:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434756095] [2025-03-03 13:22:20,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:20,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:22:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:22:20,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:20,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:22:20,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:22:20,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:22:20,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:22:20,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:20,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:22:20,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:22:20,768 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:22:20,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:22:20,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:22:20,773 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 13:22:20,791 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:22:20,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:22:20 BoogieIcfgContainer [2025-03-03 13:22:20,793 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:22:20,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:22:20,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:22:20,794 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:22:20,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:19" (3/4) ... [2025-03-03 13:22:20,795 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:22:20,830 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-03-03 13:22:20,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:22:20,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:22:20,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:22:20,879 INFO L158 Benchmark]: Toolchain (without parser) took 1811.92ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 86.8MB in the end (delta: 35.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2025-03-03 13:22:20,880 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:22:20,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.90ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 104.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:22:20,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.79ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:22:20,880 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:22:20,880 INFO L158 Benchmark]: IcfgBuilder took 298.67ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 86.0MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:22:20,880 INFO L158 Benchmark]: TraceAbstraction took 1024.45ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 93.3MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:22:20,882 INFO L158 Benchmark]: Witness Printer took 84.82ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 86.8MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:22:20,883 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.81ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.90ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 104.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.79ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 298.67ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 86.0MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1024.45ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 93.3MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.82ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 86.8MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 584]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] int flag = 1; [L533] List a = (List) malloc(sizeof(struct node)); [L534] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1] [L535] List t; [L536] List l1; [L537] List l2; [L538] List b; [L539] List u; [L540] List p = a; VAL [a={-1:0}, flag=1, p={-1:0}] [L541] COND TRUE __VERIFIER_nondet_int() [L541] COND TRUE __VERIFIER_nondet_int() [L542] COND TRUE \read(flag) [L543] p->h = 1 [L544] flag = 0 VAL [a={-1:0}, flag=0, p={-1:0}] [L549] t = (List) malloc(sizeof(struct node)) [L550] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, p={-1:0}, t={-2:0}] [L551] p->n = t [L552] EXPR p->n [L552] p = p->n [L541] COND TRUE __VERIFIER_nondet_int() [L541] COND FALSE !(__VERIFIER_nondet_int()) [L554] p->h = 3 [L555] EXPR a->h [L555] COND FALSE !(a->h == 3) [L556] flag = 1 [L557] l1 = 0 [L558] l2 = 0 [L559] p = a VAL [flag=1, l1={0:0}, l2={0:0}, p={-1:0}] [L560] COND TRUE p->h != 3 [L560] EXPR p->h [L560] COND TRUE p->h != 3 [L561] t = p [L562] EXPR p->n [L562] p = p->n [L563] COND TRUE \read(flag) [L564] t->n = l1 [L565] l1 = t [L566] flag = 0 VAL [flag=0, l1={-1:0}, l2={0:0}, p={-2:0}] [L560] COND TRUE p->h != 3 [L560] EXPR p->h [L560] COND FALSE !(p->h != 3) [L573] p = l1 VAL [flag=0, l2={0:0}, p={-1:0}] [L574] COND TRUE p != 0 [L575] EXPR p->h [L575] COND TRUE p->h != 2 [L584] reach_error() VAL [flag=0, l2={0:0}, p={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 111 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=4, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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-03-03 13:22:20,896 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE