./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-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/pthread-atomic/read_write_lock-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 ab88d5d149a161a7149bad4a02dfeb168f970e6264d498d3725e0f24ecb8e5e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:02:03,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:02:03,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:02:03,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:02:03,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:02:03,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:02:03,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:02:03,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:02:03,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:02:03,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:02:03,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:02:03,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:02:03,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:02:03,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:03,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:02:03,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:02:03,182 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 -> ab88d5d149a161a7149bad4a02dfeb168f970e6264d498d3725e0f24ecb8e5e3 [2025-03-04 02:02:03,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:02:03,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:02:03,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:02:03,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:02:03,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:02:03,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2025-03-04 02:02:04,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b46633d/08212443b76e4e8097e491956e4175bb/FLAGce4d3b738 [2025-03-04 02:02:04,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:02:04,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2025-03-04 02:02:04,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b46633d/08212443b76e4e8097e491956e4175bb/FLAGce4d3b738 [2025-03-04 02:02:05,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b46633d/08212443b76e4e8097e491956e4175bb [2025-03-04 02:02:05,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:02:05,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:02:05,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:05,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:02:05,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:02:05,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ca4528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05, skipping insertion in model container [2025-03-04 02:02:05,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:02:05,294 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/pthread-atomic/read_write_lock-1.i[30145,30158] [2025-03-04 02:02:05,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:05,318 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:02:05,358 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/pthread-atomic/read_write_lock-1.i[30145,30158] [2025-03-04 02:02:05,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:05,389 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:02:05,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05 WrapperNode [2025-03-04 02:02:05,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:05,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:05,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:02:05,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:02:05,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,414 INFO L138 Inliner]: procedures = 163, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-03-04 02:02:05,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:05,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:02:05,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:02:05,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:02:05,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,430 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 0 writes are split as follows [0, 0]. [2025-03-04 02:02:05,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:02:05,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:02:05,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:02:05,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:02:05,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (1/1) ... [2025-03-04 02:02:05,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:05,468 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-04 02:02:05,470 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-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockUnlock [2025-03-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockReadLock [2025-03-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-03-04 02:02:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-03-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockWriteLock [2025-03-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:02:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:02:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:02:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:02:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-04 02:02:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-04 02:02:05,490 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:02:05,577 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:02:05,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:02:05,689 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:02:05,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:02:05,802 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:02:05,803 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:02:05,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:05 BoogieIcfgContainer [2025-03-04 02:02:05,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:02:05,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:02:05,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:02:05,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:02:05,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:02:05" (1/3) ... [2025-03-04 02:02:05,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e45d8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:05, skipping insertion in model container [2025-03-04 02:02:05,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:05" (2/3) ... [2025-03-04 02:02:05,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e45d8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:05, skipping insertion in model container [2025-03-04 02:02:05,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:05" (3/3) ... [2025-03-04 02:02:05,813 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2025-03-04 02:02:05,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:02:05,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-1.i that has 3 procedures, 30 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:02:05,826 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:02:05,869 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 02:02:05,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 120 flow [2025-03-04 02:02:05,934 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 02:02:05,935 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:02:05,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 2/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-04 02:02:05,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 46 transitions, 120 flow [2025-03-04 02:02:05,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 101 flow [2025-03-04 02:02:05,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:05,953 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;@3026a3bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:05,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:02:05,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:05,964 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-03-04 02:02:05,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:05,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:05,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:05,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:05,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 804181252, now seen corresponding path program 1 times [2025-03-04 02:02:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835030610] [2025-03-04 02:02:05,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:06,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:02:06,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:02:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:06,160 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-04 02:02:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835030610] [2025-03-04 02:02:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835030610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:06,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331989553] [2025-03-04 02:02:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:06,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:06,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:06,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:06,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2025-03-04 02:02:06,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:06,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:06,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2025-03-04 02:02:06,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:07,268 INFO L124 PetriNetUnfolderBase]: 8977/13370 cut-off events. [2025-03-04 02:02:07,268 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2025-03-04 02:02:07,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26796 conditions, 13370 events. 8977/13370 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 86330 event pairs, 4476 based on Foata normal form. 790/13492 useless extension candidates. Maximal degree in co-relation 24273. Up to 7538 conditions per place. [2025-03-04 02:02:07,418 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 49 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-03-04 02:02:07,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 264 flow [2025-03-04 02:02:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 02:02:07,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2025-03-04 02:02:07,432 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 101 flow. Second operand 3 states and 93 transitions. [2025-03-04 02:02:07,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 264 flow [2025-03-04 02:02:07,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 242 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:02:07,455 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 114 flow [2025-03-04 02:02:07,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-04 02:02:07,460 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-04 02:02:07,463 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 114 flow [2025-03-04 02:02:07,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:07,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:07,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:07,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:02:07,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash -990534807, now seen corresponding path program 1 times [2025-03-04 02:02:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-03-04 02:02:07,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:07,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:02:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:02:07,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:07,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:07,603 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-04 02:02:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-03-04 02:02:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572021751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393914616] [2025-03-04 02:02:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:07,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:07,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:07,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-04 02:02:07,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-04 02:02:07,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:07,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-04 02:02:07,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:07,713 INFO L124 PetriNetUnfolderBase]: 468/976 cut-off events. [2025-03-04 02:02:07,713 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-03-04 02:02:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 976 events. 468/976 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5594 event pairs, 72 based on Foata normal form. 698/1630 useless extension candidates. Maximal degree in co-relation 1285. Up to 686 conditions per place. [2025-03-04 02:02:07,717 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 30 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-03-04 02:02:07,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 195 flow [2025-03-04 02:02:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-04 02:02:07,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2025-03-04 02:02:07,719 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 114 flow. Second operand 3 states and 82 transitions. [2025-03-04 02:02:07,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 195 flow [2025-03-04 02:02:07,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:02:07,722 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 103 flow [2025-03-04 02:02:07,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2025-03-04 02:02:07,722 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2025-03-04 02:02:07,722 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 103 flow [2025-03-04 02:02:07,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-04 02:02:07,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:07,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:07,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:02:07,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:07,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 46724295, now seen corresponding path program 2 times [2025-03-04 02:02:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-04 02:02:07,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:07,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:02:07,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:02:07,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:02:07,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:07,816 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-04 02:02:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-04 02:02:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417475484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633990260] [2025-03-04 02:02:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:07,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:07,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:07,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-04 02:02:07,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-04 02:02:07,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:07,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-04 02:02:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:07,887 INFO L124 PetriNetUnfolderBase]: 44/129 cut-off events. [2025-03-04 02:02:07,887 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-04 02:02:07,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 129 events. 44/129 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 463 event pairs, 4 based on Foata normal form. 60/181 useless extension candidates. Maximal degree in co-relation 219. Up to 92 conditions per place. [2025-03-04 02:02:07,889 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 18 selfloop transitions, 2 changer transitions 6/34 dead transitions. [2025-03-04 02:02:07,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 151 flow [2025-03-04 02:02:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 02:02:07,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-03-04 02:02:07,891 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 103 flow. Second operand 3 states and 72 transitions. [2025-03-04 02:02:07,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 151 flow [2025-03-04 02:02:07,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 141 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:02:07,893 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 69 flow [2025-03-04 02:02:07,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2025-03-04 02:02:07,894 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2025-03-04 02:02:07,894 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 69 flow [2025-03-04 02:02:07,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-04 02:02:07,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:07,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:02:07,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1223334578, now seen corresponding path program 1 times [2025-03-04 02:02:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690151316] [2025-03-04 02:02:07,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:07,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:02:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:07,941 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-04 02:02:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:07,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690151316] [2025-03-04 02:02:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690151316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:02:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145353459] [2025-03-04 02:02:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:02:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:07,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:02:07,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:02:07,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2025-03-04 02:02:07,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:07,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:07,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2025-03-04 02:02:07,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:07,975 INFO L124 PetriNetUnfolderBase]: 31/80 cut-off events. [2025-03-04 02:02:07,976 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-04 02:02:07,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 80 events. 31/80 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 215 event pairs, 15 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 199. Up to 45 conditions per place. [2025-03-04 02:02:07,976 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 0 selfloop transitions, 0 changer transitions 24/24 dead transitions. [2025-03-04 02:02:07,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 113 flow [2025-03-04 02:02:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:02:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:02:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-04 02:02:07,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-03-04 02:02:07,978 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 69 flow. Second operand 3 states and 54 transitions. [2025-03-04 02:02:07,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 113 flow [2025-03-04 02:02:07,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 103 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 02:02:07,979 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2025-03-04 02:02:07,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2025-03-04 02:02:07,980 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -21 predicate places. [2025-03-04 02:02:07,980 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 0 transitions, 0 flow [2025-03-04 02:02:07,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:07,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-04 02:02:07,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-03-04 02:02:07,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 02:02:07,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 02:02:07,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 02:02:07,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-04 02:02:07,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:02:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:02:07,983 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-04 02:02:07,987 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:02:07,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:02:07,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:02:07 BasicIcfg [2025-03-04 02:02:07,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:02:07,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:02:07,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:02:07,995 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:02:07,995 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:05" (3/4) ... [2025-03-04 02:02:07,997 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:02:07,999 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reader [2025-03-04 02:02:07,999 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure writer [2025-03-04 02:02:08,002 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-04 02:02:08,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 02:02:08,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 02:02:08,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:02:08,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:02:08,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:02:08,062 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:02:08,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:02:08,063 INFO L158 Benchmark]: Toolchain (without parser) took 2969.89ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 104.9MB in the beginning and 160.3MB in the end (delta: -55.3MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-03-04 02:02:08,063 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:02:08,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.44ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 85.9MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:02:08,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.88ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:02:08,064 INFO L158 Benchmark]: Boogie Preprocessor took 25.71ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:02:08,064 INFO L158 Benchmark]: IcfgBuilder took 362.31ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 59.0MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:02:08,064 INFO L158 Benchmark]: TraceAbstraction took 2188.47ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 59.0MB in the beginning and 166.7MB in the end (delta: -107.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2025-03-04 02:02:08,064 INFO L158 Benchmark]: Witness Printer took 67.64ms. Allocated memory is still 343.9MB. Free memory was 166.7MB in the beginning and 160.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:02:08,066 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.44ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 85.9MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.88ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.71ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 362.31ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 59.0MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2188.47ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 59.0MB in the beginning and 166.7MB in the end (delta: -107.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Witness Printer took 67.64ms. Allocated memory is still 343.9MB. Free memory was 166.7MB in the beginning and 160.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 685]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 4 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=1, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:02:08,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE