./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:56:52,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:56:52,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:56:52,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:56:52,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:56:52,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:56:52,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:56:52,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:56:52,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:56:52,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:56:52,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:56:52,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:56:52,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:56:52,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:56:52,410 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:56:52,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:56:52,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:56:52,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:56:52,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:56:52,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:56:52,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:56:52,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:56:52,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:56:52,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:56:52,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:52,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:56:52,413 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2025-03-09 00:56:52,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:56:52,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:56:52,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:56:52,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:56:52,661 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:56:52,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-03-09 00:56:53,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a024c95b4/7975fc396b394038b7724979b170db74/FLAGc0a4ff46c [2025-03-09 00:56:54,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:56:54,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-03-09 00:56:54,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a024c95b4/7975fc396b394038b7724979b170db74/FLAGc0a4ff46c [2025-03-09 00:56:54,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a024c95b4/7975fc396b394038b7724979b170db74 [2025-03-09 00:56:54,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:56:54,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:56:54,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:54,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:56:54,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:56:54,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79600425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54, skipping insertion in model container [2025-03-09 00:56:54,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:56:54,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:54,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:56:54,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:54,408 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:56:54,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54 WrapperNode [2025-03-09 00:56:54,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:54,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:54,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:56:54,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:56:54,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,434 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2025-03-09 00:56:54,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:54,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:56:54,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:56:54,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:56:54,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,454 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 00:56:54,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:56:54,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:56:54,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:56:54,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:56:54,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (1/1) ... [2025-03-09 00:56:54,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:54,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:54,502 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-09 00:56:54,505 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-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-03-09 00:56:54,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-03-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:56:54,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:56:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-09 00:56:54,525 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-09 00:56:54,526 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:56:54,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:56:54,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:56:54,723 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:56:54,723 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:56:54,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:56:54,805 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:56:54,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:54 BoogieIcfgContainer [2025-03-09 00:56:54,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:56:54,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:56:54,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:56:54,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:56:54,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:56:54" (1/3) ... [2025-03-09 00:56:54,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23354cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:54, skipping insertion in model container [2025-03-09 00:56:54,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:54" (2/3) ... [2025-03-09 00:56:54,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23354cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:54, skipping insertion in model container [2025-03-09 00:56:54,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:54" (3/3) ... [2025-03-09 00:56:54,814 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-03-09 00:56:54,825 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:56:54,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 00:56:54,826 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:56:54,879 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 00:56:54,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-03-09 00:56:54,932 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-03-09 00:56:54,935 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:56:54,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-09 00:56:54,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-03-09 00:56:54,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2025-03-09 00:56:54,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:56:54,964 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8a0b38f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:56:54,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:56:54,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:56:54,972 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-03-09 00:56:54,972 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:56:54,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:54,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:54,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:56:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1872889451, now seen corresponding path program 1 times [2025-03-09 00:56:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811569890] [2025-03-09 00:56:54,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:55,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:56:55,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:56:55,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:55,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:55,223 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-09 00:56:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:55,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811569890] [2025-03-09 00:56:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811569890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:56:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887101715] [2025-03-09 00:56:55,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:55,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:55,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:55,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:55,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:56:55,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-09 00:56:55,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:55,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:56:55,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:58,934 INFO L124 PetriNetUnfolderBase]: 49254/70613 cut-off events. [2025-03-09 00:56:58,934 INFO L125 PetriNetUnfolderBase]: For 5350/5350 co-relation queries the response was YES. [2025-03-09 00:56:59,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140298 conditions, 70613 events. 49254/70613 cut-off events. For 5350/5350 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 493785 event pairs, 5837 based on Foata normal form. 5282/74939 useless extension candidates. Maximal degree in co-relation 126247. Up to 18683 conditions per place. [2025-03-09 00:56:59,360 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 256 selfloop transitions, 37 changer transitions 0/302 dead transitions. [2025-03-09 00:56:59,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 302 transitions, 1307 flow [2025-03-09 00:56:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:56:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:56:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 517 transitions. [2025-03-09 00:56:59,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641439205955335 [2025-03-09 00:56:59,376 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 517 transitions. [2025-03-09 00:56:59,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 302 transitions, 1307 flow [2025-03-09 00:56:59,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 302 transitions, 1229 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:59,443 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2025-03-09 00:56:59,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2025-03-09 00:56:59,447 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-03-09 00:56:59,447 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2025-03-09 00:56:59,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-09 00:56:59,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:59,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:59,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:56:59,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:56:59,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1727648956, now seen corresponding path program 1 times [2025-03-09 00:56:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:59,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808850975] [2025-03-09 00:56:59,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:59,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:56:59,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:56:59,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:59,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:59,523 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-09 00:56:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:59,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808850975] [2025-03-09 00:56:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808850975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:59,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368345367] [2025-03-09 00:56:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:59,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:59,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:59,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:59,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-09 00:56:59,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 00:56:59,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:59,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-09 00:56:59,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:01,809 INFO L124 PetriNetUnfolderBase]: 34267/51230 cut-off events. [2025-03-09 00:57:01,809 INFO L125 PetriNetUnfolderBase]: For 20226/20226 co-relation queries the response was YES. [2025-03-09 00:57:01,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120384 conditions, 51230 events. 34267/51230 cut-off events. For 20226/20226 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 365933 event pairs, 11926 based on Foata normal form. 2768/53835 useless extension candidates. Maximal degree in co-relation 105714. Up to 25754 conditions per place. [2025-03-09 00:57:02,046 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 118 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-09 00:57:02,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 761 flow [2025-03-09 00:57:02,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-09 00:57:02,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2025-03-09 00:57:02,049 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 122 transitions. [2025-03-09 00:57:02,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 761 flow [2025-03-09 00:57:02,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 761 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:02,532 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2025-03-09 00:57:02,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2025-03-09 00:57:02,533 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-03-09 00:57:02,533 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2025-03-09 00:57:02,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 00:57:02,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:02,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:02,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:57:02,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:02,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1086056794, now seen corresponding path program 2 times [2025-03-09 00:57:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256309079] [2025-03-09 00:57:02,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:02,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:57:02,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:57:02,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:57:02,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:02,631 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-09 00:57:02,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256309079] [2025-03-09 00:57:02,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256309079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:02,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:57:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990163737] [2025-03-09 00:57:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:02,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:57:02,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:02,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:57:02,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:57:02,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-09 00:57:02,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 00:57:02,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:02,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-09 00:57:02,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:04,023 INFO L124 PetriNetUnfolderBase]: 18165/28309 cut-off events. [2025-03-09 00:57:04,023 INFO L125 PetriNetUnfolderBase]: For 19765/19772 co-relation queries the response was YES. [2025-03-09 00:57:04,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68758 conditions, 28309 events. 18165/28309 cut-off events. For 19765/19772 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 200666 event pairs, 4884 based on Foata normal form. 1729/30032 useless extension candidates. Maximal degree in co-relation 62912. Up to 11484 conditions per place. [2025-03-09 00:57:04,129 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 152 selfloop transitions, 9 changer transitions 0/173 dead transitions. [2025-03-09 00:57:04,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 173 transitions, 994 flow [2025-03-09 00:57:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:57:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:57:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-03-09 00:57:04,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7016129032258065 [2025-03-09 00:57:04,130 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 174 transitions. [2025-03-09 00:57:04,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 173 transitions, 994 flow [2025-03-09 00:57:04,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 173 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:57:04,313 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2025-03-09 00:57:04,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2025-03-09 00:57:04,313 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2025-03-09 00:57:04,313 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2025-03-09 00:57:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 00:57:04,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:04,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:57:04,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1973663013, now seen corresponding path program 1 times [2025-03-09 00:57:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153813622] [2025-03-09 00:57:04,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:04,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 00:57:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 00:57:04,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:04,378 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-09 00:57:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:04,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153813622] [2025-03-09 00:57:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153813622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:04,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:57:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784033905] [2025-03-09 00:57:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:04,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:04,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:04,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:57:04,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-09 00:57:04,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:04,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:57:04,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:06,557 INFO L124 PetriNetUnfolderBase]: 23109/34872 cut-off events. [2025-03-09 00:57:06,558 INFO L125 PetriNetUnfolderBase]: For 27262/27266 co-relation queries the response was YES. [2025-03-09 00:57:06,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90817 conditions, 34872 events. 23109/34872 cut-off events. For 27262/27266 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 238198 event pairs, 3418 based on Foata normal form. 0/34625 useless extension candidates. Maximal degree in co-relation 84840. Up to 9700 conditions per place. [2025-03-09 00:57:06,694 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 294 selfloop transitions, 70 changer transitions 0/375 dead transitions. [2025-03-09 00:57:06,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 375 transitions, 2375 flow [2025-03-09 00:57:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:57:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:57:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2025-03-09 00:57:06,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818858560794045 [2025-03-09 00:57:06,696 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 469 transitions. [2025-03-09 00:57:06,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 375 transitions, 2375 flow [2025-03-09 00:57:06,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 375 transitions, 2375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:07,002 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2025-03-09 00:57:07,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1038, PETRI_PLACES=105, PETRI_TRANSITIONS=157} [2025-03-09 00:57:07,002 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2025-03-09 00:57:07,002 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2025-03-09 00:57:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-09 00:57:07,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:07,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:07,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:57:07,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:07,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1944693381, now seen corresponding path program 1 times [2025-03-09 00:57:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:07,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756980730] [2025-03-09 00:57:07,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:07,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:57:07,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:57:07,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:07,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:07,068 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-09 00:57:07,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:07,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756980730] [2025-03-09 00:57:07,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756980730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:07,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:07,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:57:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530255727] [2025-03-09 00:57:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:07,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:07,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:07,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:07,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:07,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:57:07,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 157 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:57:07,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:07,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:57:07,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:09,357 INFO L124 PetriNetUnfolderBase]: 23421/35356 cut-off events. [2025-03-09 00:57:09,357 INFO L125 PetriNetUnfolderBase]: For 44603/44607 co-relation queries the response was YES. [2025-03-09 00:57:09,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105329 conditions, 35356 events. 23421/35356 cut-off events. For 44603/44607 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 242686 event pairs, 4069 based on Foata normal form. 234/35588 useless extension candidates. Maximal degree in co-relation 99346. Up to 11446 conditions per place. [2025-03-09 00:57:09,698 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 261 selfloop transitions, 87 changer transitions 0/359 dead transitions. [2025-03-09 00:57:09,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 359 transitions, 2696 flow [2025-03-09 00:57:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:57:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:57:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 426 transitions. [2025-03-09 00:57:09,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285359801488834 [2025-03-09 00:57:09,700 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 426 transitions. [2025-03-09 00:57:09,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 359 transitions, 2696 flow [2025-03-09 00:57:10,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 359 transitions, 2694 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:10,500 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2025-03-09 00:57:10,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1516, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2025-03-09 00:57:10,501 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2025-03-09 00:57:10,501 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2025-03-09 00:57:10,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:57:10,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:10,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:10,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:57:10,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:10,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash -177396787, now seen corresponding path program 1 times [2025-03-09 00:57:10,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:10,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421225767] [2025-03-09 00:57:10,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:10,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:57:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:57:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:10,568 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-09 00:57:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:10,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421225767] [2025-03-09 00:57:10,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421225767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:10,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:10,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:57:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969636125] [2025-03-09 00:57:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:10,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:10,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:10,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:10,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:10,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:57:10,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1516 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:57:10,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:10,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:57:10,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:13,188 INFO L124 PetriNetUnfolderBase]: 24125/36201 cut-off events. [2025-03-09 00:57:13,188 INFO L125 PetriNetUnfolderBase]: For 64415/64419 co-relation queries the response was YES. [2025-03-09 00:57:13,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113053 conditions, 36201 events. 24125/36201 cut-off events. For 64415/64419 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 245448 event pairs, 4175 based on Foata normal form. 245/36444 useless extension candidates. Maximal degree in co-relation 106408. Up to 11644 conditions per place. [2025-03-09 00:57:13,469 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 286 selfloop transitions, 94 changer transitions 0/395 dead transitions. [2025-03-09 00:57:13,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 395 transitions, 3329 flow [2025-03-09 00:57:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:57:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:57:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 428 transitions. [2025-03-09 00:57:13,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5310173697270472 [2025-03-09 00:57:13,471 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 428 transitions. [2025-03-09 00:57:13,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 395 transitions, 3329 flow [2025-03-09 00:57:14,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 395 transitions, 3310 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:14,744 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2025-03-09 00:57:14,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2010, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2025-03-09 00:57:14,745 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2025-03-09 00:57:14,745 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2025-03-09 00:57:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:57:14,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:14,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:14,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:57:14,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:14,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 323613961, now seen corresponding path program 1 times [2025-03-09 00:57:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96960411] [2025-03-09 00:57:14,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:14,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 00:57:14,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 00:57:14,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:14,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:14,824 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-09 00:57:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96960411] [2025-03-09 00:57:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96960411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:57:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664682340] [2025-03-09 00:57:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:14,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:14,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-09 00:57:14,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 215 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-09 00:57:14,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:14,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-09 00:57:14,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:18,009 INFO L124 PetriNetUnfolderBase]: 25040/38741 cut-off events. [2025-03-09 00:57:18,010 INFO L125 PetriNetUnfolderBase]: For 92436/92529 co-relation queries the response was YES. [2025-03-09 00:57:18,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122503 conditions, 38741 events. 25040/38741 cut-off events. For 92436/92529 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 281469 event pairs, 5772 based on Foata normal form. 715/39432 useless extension candidates. Maximal degree in co-relation 118010. Up to 13973 conditions per place. [2025-03-09 00:57:18,296 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 336 selfloop transitions, 28 changer transitions 0/385 dead transitions. [2025-03-09 00:57:18,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 385 transitions, 3662 flow [2025-03-09 00:57:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:57:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 00:57:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2025-03-09 00:57:18,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2025-03-09 00:57:18,297 INFO L175 Difference]: Start difference. First operand has 136 places, 215 transitions, 2010 flow. Second operand 9 states and 324 transitions. [2025-03-09 00:57:18,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 385 transitions, 3662 flow [2025-03-09 00:57:19,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 385 transitions, 3544 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-09 00:57:19,536 INFO L231 Difference]: Finished difference. Result has 145 places, 212 transitions, 1865 flow [2025-03-09 00:57:19,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1865, PETRI_PLACES=145, PETRI_TRANSITIONS=212} [2025-03-09 00:57:19,536 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 79 predicate places. [2025-03-09 00:57:19,536 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 212 transitions, 1865 flow [2025-03-09 00:57:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-09 00:57:19,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:19,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:19,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:57:19,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:19,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1774277855, now seen corresponding path program 2 times [2025-03-09 00:57:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-03-09 00:57:19,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:19,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:19,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-09 00:57:19,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 00:57:19,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:57:19,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:19,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:19,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 00:57:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 00:57:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:19,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:19,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:19,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-03-09 00:57:19,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-09 00:57:19,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-09 00:57:19,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-03-09 00:57:19,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-03-09 00:57:19,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-03-09 00:57:19,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-09 00:57:19,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-09 00:57:19,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:57:19,586 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-09 00:57:19,629 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:57:19,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:57:19,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:57:19 BasicIcfg [2025-03-09 00:57:19,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:57:19,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:57:19,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:57:19,637 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:57:19,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:54" (3/4) ... [2025-03-09 00:57:19,639 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:57:19,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:57:19,640 INFO L158 Benchmark]: Toolchain (without parser) took 25569.57ms. Allocated memory was 167.8MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 122.3MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-09 00:57:19,640 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:57:19,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.33ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 102.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 00:57:19,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.15ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:57:19,641 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 99.3MB in the end (delta: 948.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:57:19,641 INFO L158 Benchmark]: IcfgBuilder took 338.91ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 78.7MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 00:57:19,641 INFO L158 Benchmark]: TraceAbstraction took 24825.49ms. Allocated memory was 167.8MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 78.7MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-09 00:57:19,641 INFO L158 Benchmark]: Witness Printer took 5.93ms. Allocated memory is still 8.2GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:57:19,642 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.33ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 102.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.15ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 99.3MB in the end (delta: 948.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.91ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 78.7MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24825.49ms. Allocated memory was 167.8MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 78.7MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 5.93ms. Allocated memory is still 8.2GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 locations, 91 edges, 8 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: 24.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1003 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2848 IncrementalHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 6 mSDtfsCounter, 2848 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2010occurred in iteration=6, InterpolantAutomatonStates: 68, 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.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 00:57:19,657 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:57:22,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:57:22,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:57:22,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:57:22,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:57:22,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:57:22,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:57:22,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:57:22,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:57:22,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:57:22,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:57:22,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:57:22,141 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:57:22,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:22,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:57:22,142 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:57:22,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:57:22,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:57:22,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:57:22,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:57:22,143 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2025-03-09 00:57:22,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:57:22,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:57:22,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:57:22,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:57:22,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:57:22,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-03-09 00:57:23,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9942b78/d7f6352705d442f0b477e07fa99697d6/FLAGd04c6a4f0 [2025-03-09 00:57:23,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:57:23,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2025-03-09 00:57:23,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9942b78/d7f6352705d442f0b477e07fa99697d6/FLAGd04c6a4f0 [2025-03-09 00:57:23,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9942b78/d7f6352705d442f0b477e07fa99697d6 [2025-03-09 00:57:23,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:57:23,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:57:23,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:23,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:57:23,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:57:23,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:23" (1/1) ... [2025-03-09 00:57:23,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c93e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:23, skipping insertion in model container [2025-03-09 00:57:23,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:23" (1/1) ... [2025-03-09 00:57:23,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:57:24,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:24,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:57:24,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:24,271 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:57:24,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24 WrapperNode [2025-03-09 00:57:24,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:24,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:24,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:57:24,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:57:24,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,317 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2025-03-09 00:57:24,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:24,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:57:24,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:57:24,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:57:24,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 00:57:24,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:57:24,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:57:24,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:57:24,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:57:24,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (1/1) ... [2025-03-09 00:57:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:24,380 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-09 00:57:24,383 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-09 00:57:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:57:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:57:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-03-09 00:57:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-03-09 00:57:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:57:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:57:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:57:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:57:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-09 00:57:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-09 00:57:24,405 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:57:24,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:57:24,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:57:24,644 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:57:24,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:57:24,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:57:24,745 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:57:24,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:24 BoogieIcfgContainer [2025-03-09 00:57:24,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:57:24,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:57:24,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:57:24,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:57:24,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:57:23" (1/3) ... [2025-03-09 00:57:24,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd2c5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:24, skipping insertion in model container [2025-03-09 00:57:24,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:24" (2/3) ... [2025-03-09 00:57:24,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd2c5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:24, skipping insertion in model container [2025-03-09 00:57:24,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:24" (3/3) ... [2025-03-09 00:57:24,756 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-03-09 00:57:24,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:57:24,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 00:57:24,769 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:57:24,833 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 00:57:24,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-03-09 00:57:24,891 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-03-09 00:57:24,893 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:57:24,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-09 00:57:24,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-03-09 00:57:24,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2025-03-09 00:57:24,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:24,918 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36b42a37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:24,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:57:24,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:24,932 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-03-09 00:57:24,932 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:57:24,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:24,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:24,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -737794835, now seen corresponding path program 1 times [2025-03-09 00:57:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:57:24,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392875945] [2025-03-09 00:57:24,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:24,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:24,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:24,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:57:25,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:57:25,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:57:25,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:57:25,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:25,103 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-09 00:57:25,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:25,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:57:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392875945] [2025-03-09 00:57:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392875945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:25,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:57:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433346108] [2025-03-09 00:57:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:25,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:57:25,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:25,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:25,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:57:25,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-09 00:57:25,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:25,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:57:25,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:29,128 INFO L124 PetriNetUnfolderBase]: 49254/70613 cut-off events. [2025-03-09 00:57:29,129 INFO L125 PetriNetUnfolderBase]: For 5350/5350 co-relation queries the response was YES. [2025-03-09 00:57:29,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140298 conditions, 70613 events. 49254/70613 cut-off events. For 5350/5350 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 493684 event pairs, 5837 based on Foata normal form. 5282/74939 useless extension candidates. Maximal degree in co-relation 126247. Up to 18683 conditions per place. [2025-03-09 00:57:29,498 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 256 selfloop transitions, 37 changer transitions 0/302 dead transitions. [2025-03-09 00:57:29,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 302 transitions, 1307 flow [2025-03-09 00:57:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:57:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:57:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 517 transitions. [2025-03-09 00:57:29,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641439205955335 [2025-03-09 00:57:29,510 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 517 transitions. [2025-03-09 00:57:29,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 302 transitions, 1307 flow [2025-03-09 00:57:29,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 302 transitions, 1229 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 00:57:29,606 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2025-03-09 00:57:29,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2025-03-09 00:57:29,610 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-03-09 00:57:29,610 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2025-03-09 00:57:29,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-09 00:57:29,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:29,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:29,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:57:29,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:29,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:29,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash 99882684, now seen corresponding path program 1 times [2025-03-09 00:57:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:57:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928486166] [2025-03-09 00:57:29,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:29,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:29,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:29,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:29,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:57:29,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:57:29,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:57:29,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:29,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:29,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:57:29,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:29,885 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-09 00:57:29,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:29,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:57:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928486166] [2025-03-09 00:57:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928486166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:57:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877525789] [2025-03-09 00:57:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:29,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:29,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:57:29,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:29,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:29,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-09 00:57:29,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 00:57:29,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:29,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-09 00:57:29,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:32,550 INFO L124 PetriNetUnfolderBase]: 34267/51230 cut-off events. [2025-03-09 00:57:32,550 INFO L125 PetriNetUnfolderBase]: For 20226/20226 co-relation queries the response was YES. [2025-03-09 00:57:32,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120384 conditions, 51230 events. 34267/51230 cut-off events. For 20226/20226 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 366062 event pairs, 11926 based on Foata normal form. 2768/53835 useless extension candidates. Maximal degree in co-relation 105714. Up to 25754 conditions per place. [2025-03-09 00:57:32,793 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 118 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-09 00:57:32,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 761 flow [2025-03-09 00:57:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-09 00:57:32,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2025-03-09 00:57:32,795 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 122 transitions. [2025-03-09 00:57:32,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 761 flow [2025-03-09 00:57:33,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 761 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:33,241 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2025-03-09 00:57:33,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2025-03-09 00:57:33,241 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-03-09 00:57:33,242 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2025-03-09 00:57:33,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 00:57:33,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:33,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:33,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:57:33,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:33,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:33,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash -541709478, now seen corresponding path program 2 times [2025-03-09 00:57:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:57:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684207080] [2025-03-09 00:57:33,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:33,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:33,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:57:33,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:57:33,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:57:33,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:57:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:33,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:57:33,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:33,538 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-09 00:57:33,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:33,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:57:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684207080] [2025-03-09 00:57:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684207080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:57:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942301106] [2025-03-09 00:57:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:33,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:57:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:57:33,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:57:33,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:57:33,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-09 00:57:33,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 00:57:33,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:33,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-09 00:57:33,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:36,528 INFO L124 PetriNetUnfolderBase]: 40434/62009 cut-off events. [2025-03-09 00:57:36,528 INFO L125 PetriNetUnfolderBase]: For 41673/41680 co-relation queries the response was YES. [2025-03-09 00:57:36,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156452 conditions, 62009 events. 40434/62009 cut-off events. For 41673/41680 co-relation queries the response was YES. Maximal size of possible extension queue 2418. Compared 484429 event pairs, 14421 based on Foata normal form. 663/62537 useless extension candidates. Maximal degree in co-relation 134060. Up to 32081 conditions per place. [2025-03-09 00:57:36,862 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 172 selfloop transitions, 11 changer transitions 0/195 dead transitions. [2025-03-09 00:57:36,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 195 transitions, 1152 flow [2025-03-09 00:57:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:57:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:57:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-03-09 00:57:36,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975806451612904 [2025-03-09 00:57:36,863 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 173 transitions. [2025-03-09 00:57:36,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 195 transitions, 1152 flow [2025-03-09 00:57:38,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 195 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:57:38,094 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 444 flow [2025-03-09 00:57:38,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2025-03-09 00:57:38,095 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-03-09 00:57:38,095 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 444 flow [2025-03-09 00:57:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 00:57:38,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:38,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:38,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:57:38,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:38,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:38,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -894809891, now seen corresponding path program 1 times [2025-03-09 00:57:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:57:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188472293] [2025-03-09 00:57:38,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:38,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:38,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:38,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:38,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:57:38,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 00:57:38,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 00:57:38,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:38,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:38,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:57:38,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:38,377 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-09 00:57:38,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:38,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:57:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188472293] [2025-03-09 00:57:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188472293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:38,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:57:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655646991] [2025-03-09 00:57:38,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:38,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:57:38,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:38,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:38,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:57:38,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-09 00:57:38,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:38,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:57:38,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:44,556 INFO L124 PetriNetUnfolderBase]: 84267/124012 cut-off events. [2025-03-09 00:57:44,556 INFO L125 PetriNetUnfolderBase]: For 100081/100125 co-relation queries the response was YES. [2025-03-09 00:57:44,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325329 conditions, 124012 events. 84267/124012 cut-off events. For 100081/100125 co-relation queries the response was YES. Maximal size of possible extension queue 4868. Compared 978360 event pairs, 12451 based on Foata normal form. 41/122019 useless extension candidates. Maximal degree in co-relation 281933. Up to 31079 conditions per place. [2025-03-09 00:57:45,398 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 385 selfloop transitions, 153 changer transitions 0/549 dead transitions. [2025-03-09 00:57:45,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 549 transitions, 3607 flow [2025-03-09 00:57:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:57:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:57:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 483 transitions. [2025-03-09 00:57:45,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5992555831265509 [2025-03-09 00:57:45,400 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 444 flow. Second operand 13 states and 483 transitions. [2025-03-09 00:57:45,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 549 transitions, 3607 flow [2025-03-09 00:57:50,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 549 transitions, 3589 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:50,089 INFO L231 Difference]: Finished difference. Result has 102 places, 275 transitions, 2009 flow [2025-03-09 00:57:50,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2009, PETRI_PLACES=102, PETRI_TRANSITIONS=275} [2025-03-09 00:57:50,091 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 36 predicate places. [2025-03-09 00:57:50,091 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 275 transitions, 2009 flow [2025-03-09 00:57:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-09 00:57:50,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:50,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:50,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:57:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:50,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:57:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -648908035, now seen corresponding path program 1 times [2025-03-09 00:57:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:57:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110149862] [2025-03-09 00:57:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:50,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:50,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:50,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:57:50,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:57:50,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:57:50,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:50,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:50,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:57:50,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:50,369 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-09 00:57:50,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:50,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:57:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110149862] [2025-03-09 00:57:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110149862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:57:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504690407] [2025-03-09 00:57:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:57:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:57:50,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:57:50,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:57:50,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:57:50,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 275 transitions, 2009 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:57:50,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:50,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:57:50,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:59,477 INFO L124 PetriNetUnfolderBase]: 88601/130462 cut-off events. [2025-03-09 00:57:59,477 INFO L125 PetriNetUnfolderBase]: For 176053/176056 co-relation queries the response was YES. [2025-03-09 00:58:00,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397547 conditions, 130462 events. 88601/130462 cut-off events. For 176053/176056 co-relation queries the response was YES. Maximal size of possible extension queue 5112. Compared 1040064 event pairs, 13955 based on Foata normal form. 1058/131368 useless extension candidates. Maximal degree in co-relation 352121. Up to 37145 conditions per place. [2025-03-09 00:58:00,602 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 369 selfloop transitions, 223 changer transitions 0/603 dead transitions. [2025-03-09 00:58:00,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 603 transitions, 4981 flow [2025-03-09 00:58:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:58:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 00:58:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 460 transitions. [2025-03-09 00:58:00,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707196029776674 [2025-03-09 00:58:00,604 INFO L175 Difference]: Start difference. First operand has 102 places, 275 transitions, 2009 flow. Second operand 13 states and 460 transitions. [2025-03-09 00:58:00,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 603 transitions, 4981 flow [2025-03-09 00:58:12,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 603 transitions, 4979 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:12,026 INFO L231 Difference]: Finished difference. Result has 122 places, 363 transitions, 3507 flow [2025-03-09 00:58:12,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3507, PETRI_PLACES=122, PETRI_TRANSITIONS=363} [2025-03-09 00:58:12,029 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 56 predicate places. [2025-03-09 00:58:12,029 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 363 transitions, 3507 flow [2025-03-09 00:58:12,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:58:12,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:12,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:12,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:58:12,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:58:12,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:58:12,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1118388559, now seen corresponding path program 1 times [2025-03-09 00:58:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:58:12,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563938500] [2025-03-09 00:58:12,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:12,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:58:12,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:58:12,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:58:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:58:12,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:58:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:58:12,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:12,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:12,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:58:12,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:58:12,323 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-09 00:58:12,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:58:12,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:58:12,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563938500] [2025-03-09 00:58:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563938500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:12,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:12,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:58:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10378215] [2025-03-09 00:58:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:12,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:58:12,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:58:12,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:58:12,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:58:12,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2025-03-09 00:58:12,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 363 transitions, 3507 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-09 00:58:12,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:12,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2025-03-09 00:58:12,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand