./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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-theta/unwind3-100.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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:35:55,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:35:55,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:35:55,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:35:55,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:35:55,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:35:55,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:35:55,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:35:55,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:35:55,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:35:55,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:35:55,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:35:55,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:35:55,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:35:55,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:35:55,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:35:55,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:35:55,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:35:55,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:35:55,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:35:55,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:35:55,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:35:55,510 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-03-17 14:35:55,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:35:55,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:35:55,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:35:55,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:35:55,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:35:55,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-17 14:35:56,878 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa217c247/62634cd7c55e4f8c9943cdece1f4140e/FLAGf6f9c3b9c [2025-03-17 14:35:57,121 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:35:57,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-17 14:35:57,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa217c247/62634cd7c55e4f8c9943cdece1f4140e/FLAGf6f9c3b9c [2025-03-17 14:35:57,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa217c247/62634cd7c55e4f8c9943cdece1f4140e [2025-03-17 14:35:57,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:35:57,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:35:57,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:35:57,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:35:57,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:35:57,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d65918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57, skipping insertion in model container [2025-03-17 14:35:57,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:35:57,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:35:57,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:35:57,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:35:57,431 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:35:57,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57 WrapperNode [2025-03-17 14:35:57,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:35:57,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:35:57,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:35:57,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:35:57,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,455 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-03-17 14:35:57,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:35:57,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:35:57,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:35:57,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:35:57,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,470 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-17 14:35:57,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:35:57,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:35:57,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:35:57,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:35:57,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (1/1) ... [2025-03-17 14:35:57,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:35:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:35:57,512 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-17 14:35:57,515 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-17 14:35:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:35:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-17 14:35:57,532 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-17 14:35:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-17 14:35:57,532 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-17 14:35:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:35:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:35:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:35:57,533 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:35:57,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:35:57,632 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:35:57,767 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:35:57,767 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:35:57,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:35:57,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:35:57,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:57 BoogieIcfgContainer [2025-03-17 14:35:57,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:35:57,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:35:57,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:35:57,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:35:57,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:35:57" (1/3) ... [2025-03-17 14:35:57,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ce441c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:57, skipping insertion in model container [2025-03-17 14:35:57,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:57" (2/3) ... [2025-03-17 14:35:57,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ce441c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:57, skipping insertion in model container [2025-03-17 14:35:57,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:57" (3/3) ... [2025-03-17 14:35:57,872 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-03-17 14:35:57,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:35:57,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-17 14:35:57,885 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:35:57,928 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:35:57,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-03-17 14:35:57,985 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-03-17 14:35:57,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:35:57,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-03-17 14:35:57,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-03-17 14:35:57,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-03-17 14:35:58,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:35:58,016 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;@7eaf688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:35:58,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 14:35:58,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:35:58,021 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-17 14:35:58,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:35:58,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:58,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:58,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 14:35:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 993100999, now seen corresponding path program 1 times [2025-03-17 14:35:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341980745] [2025-03-17 14:35:58,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:58,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:35:58,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:35:58,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:58,248 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-17 14:35:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341980745] [2025-03-17 14:35:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341980745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:58,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:58,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802647384] [2025-03-17 14:35:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:58,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:58,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:58,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:58,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-17 14:35:58,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-17 14:35:58,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:58,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-17 14:35:58,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:58,382 INFO L124 PetriNetUnfolderBase]: 98/222 cut-off events. [2025-03-17 14:35:58,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:35:58,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 222 events. 98/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 867 event pairs, 32 based on Foata normal form. 24/226 useless extension candidates. Maximal degree in co-relation 394. Up to 172 conditions per place. [2025-03-17 14:35:58,386 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 19 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-17 14:35:58,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 105 flow [2025-03-17 14:35:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-03-17 14:35:58,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-03-17 14:35:58,396 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 49 transitions. [2025-03-17 14:35:58,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 105 flow [2025-03-17 14:35:58,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:35:58,400 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2025-03-17 14:35:58,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-03-17 14:35:58,403 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-03-17 14:35:58,403 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2025-03-17 14:35:58,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-17 14:35:58,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:58,403 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:35:58,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 14:35:58,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 720372233, now seen corresponding path program 1 times [2025-03-17 14:35:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:58,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343499469] [2025-03-17 14:35:58,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:58,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:35:58,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:35:58,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:35:58,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:35:58,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:35:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:35:58,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:35:58,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:35:58,453 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:35:58,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-17 14:35:58,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-17 14:35:58,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-17 14:35:58,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-03-17 14:35:58,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-17 14:35:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:35:58,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 14:35:58,458 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:35:58,458 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:35:58,484 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:35:58,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 106 flow [2025-03-17 14:35:58,498 INFO L124 PetriNetUnfolderBase]: 9/65 cut-off events. [2025-03-17 14:35:58,498 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:58,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 65 events. 9/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 182 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 76. Up to 6 conditions per place. [2025-03-17 14:35:58,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 106 flow [2025-03-17 14:35:58,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 73 flow [2025-03-17 14:35:58,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:35:58,500 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;@7eaf688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:35:58,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:35:58,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:35:58,503 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-17 14:35:58,503 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:35:58,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:58,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:58,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:35:58,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1773156641, now seen corresponding path program 1 times [2025-03-17 14:35:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:58,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263985790] [2025-03-17 14:35:58,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:35:58,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:35:58,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:58,582 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-17 14:35:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263985790] [2025-03-17 14:35:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263985790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:58,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:58,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442561281] [2025-03-17 14:35:58,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:58,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:58,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:58,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:58,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-17 14:35:58,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-17 14:35:58,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:58,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-17 14:35:58,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:58,761 INFO L124 PetriNetUnfolderBase]: 718/1286 cut-off events. [2025-03-17 14:35:58,761 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 14:35:58,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1286 events. 718/1286 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6497 event pairs, 376 based on Foata normal form. 120/1302 useless extension candidates. Maximal degree in co-relation 540. Up to 1096 conditions per place. [2025-03-17 14:35:58,773 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-03-17 14:35:58,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 131 flow [2025-03-17 14:35:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-17 14:35:58,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38372093023255816 [2025-03-17 14:35:58,775 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 73 flow. Second operand 4 states and 66 transitions. [2025-03-17 14:35:58,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 131 flow [2025-03-17 14:35:58,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:35:58,776 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 80 flow [2025-03-17 14:35:58,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-03-17 14:35:58,777 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-17 14:35:58,777 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 80 flow [2025-03-17 14:35:58,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-17 14:35:58,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:58,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:58,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:35:58,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:35:58,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash -670960612, now seen corresponding path program 1 times [2025-03-17 14:35:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176920665] [2025-03-17 14:35:58,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:58,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:35:58,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:35:58,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:58,817 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-17 14:35:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176920665] [2025-03-17 14:35:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176920665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:58,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:58,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:35:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718507879] [2025-03-17 14:35:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:58,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:58,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:58,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-17 14:35:58,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:58,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:58,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-17 14:35:58,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:58,936 INFO L124 PetriNetUnfolderBase]: 718/1262 cut-off events. [2025-03-17 14:35:58,936 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-17 14:35:58,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1262 events. 718/1262 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6160 event pairs, 658 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 1774. Up to 1101 conditions per place. [2025-03-17 14:35:58,943 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-03-17 14:35:58,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 122 flow [2025-03-17 14:35:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-17 14:35:58,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3798449612403101 [2025-03-17 14:35:58,944 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 80 flow. Second operand 3 states and 49 transitions. [2025-03-17 14:35:58,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 122 flow [2025-03-17 14:35:58,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:58,945 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 74 flow [2025-03-17 14:35:58,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-03-17 14:35:58,946 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-03-17 14:35:58,946 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 74 flow [2025-03-17 14:35:58,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:58,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:58,946 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:58,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:35:58,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:35:58,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash 674069901, now seen corresponding path program 1 times [2025-03-17 14:35:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:58,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490076614] [2025-03-17 14:35:58,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:58,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:58,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:35:58,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:35:58,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:35:58,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:35:58,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:35:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:35:58,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:35:58,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:35:58,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:35:58,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-17 14:35:58,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-17 14:35:58,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-17 14:35:58,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-03-17 14:35:58,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-17 14:35:58,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-17 14:35:58,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:35:58,986 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 14:35:58,987 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:35:58,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 14:35:59,017 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:35:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 154 flow [2025-03-17 14:35:59,027 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2025-03-17 14:35:59,027 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:35:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 87 events. 12/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 268 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2025-03-17 14:35:59,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 59 transitions, 154 flow [2025-03-17 14:35:59,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 34 transitions, 89 flow [2025-03-17 14:35:59,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:35:59,032 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;@7eaf688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:35:59,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:35:59,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:35:59,034 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-17 14:35:59,034 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:35:59,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:59,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:59,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 14:35:59,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 46737291, now seen corresponding path program 1 times [2025-03-17 14:35:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556141620] [2025-03-17 14:35:59,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:59,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:35:59,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:35:59,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:59,076 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-17 14:35:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556141620] [2025-03-17 14:35:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556141620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439875031] [2025-03-17 14:35:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:59,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:59,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:59,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-03-17 14:35:59,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-17 14:35:59,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:59,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-03-17 14:35:59,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:59,499 INFO L124 PetriNetUnfolderBase]: 4110/6046 cut-off events. [2025-03-17 14:35:59,499 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2025-03-17 14:35:59,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12008 conditions, 6046 events. 4110/6046 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 30500 event pairs, 2664 based on Foata normal form. 456/6142 useless extension candidates. Maximal degree in co-relation 2438. Up to 5704 conditions per place. [2025-03-17 14:35:59,528 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 28 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-17 14:35:59,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 155 flow [2025-03-17 14:35:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-17 14:35:59,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3474576271186441 [2025-03-17 14:35:59,531 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 89 flow. Second operand 4 states and 82 transitions. [2025-03-17 14:35:59,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 155 flow [2025-03-17 14:35:59,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 152 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:35:59,535 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2025-03-17 14:35:59,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-03-17 14:35:59,537 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-17 14:35:59,537 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2025-03-17 14:35:59,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-17 14:35:59,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:59,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:59,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:35:59,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 14:35:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -225003011, now seen corresponding path program 1 times [2025-03-17 14:35:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284335323] [2025-03-17 14:35:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:59,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:35:59,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:35:59,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:59,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:59,570 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-17 14:35:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284335323] [2025-03-17 14:35:59,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284335323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:59,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:59,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:35:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253642322] [2025-03-17 14:35:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:59,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:59,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:59,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:59,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-03-17 14:35:59,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:59,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:59,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-03-17 14:35:59,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:59,938 INFO L124 PetriNetUnfolderBase]: 4110/6022 cut-off events. [2025-03-17 14:35:59,938 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-03-17 14:35:59,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12142 conditions, 6022 events. 4110/6022 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 30139 event pairs, 3858 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 8876. Up to 5709 conditions per place. [2025-03-17 14:35:59,961 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 24 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-03-17 14:35:59,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 144 flow [2025-03-17 14:35:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-17 14:35:59,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3502824858757062 [2025-03-17 14:35:59,964 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 3 states and 62 transitions. [2025-03-17 14:35:59,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 144 flow [2025-03-17 14:35:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:59,965 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2025-03-17 14:35:59,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2025-03-17 14:35:59,966 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-03-17 14:35:59,966 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 88 flow [2025-03-17 14:35:59,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:59,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:59,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:35:59,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 14:35:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1410593541, now seen corresponding path program 1 times [2025-03-17 14:35:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427058643] [2025-03-17 14:35:59,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:59,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:35:59,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:35:59,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:00,069 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-17 14:36:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427058643] [2025-03-17 14:36:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427058643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:36:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473884583] [2025-03-17 14:36:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:36:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:00,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:36:00,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:36:00,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-03-17 14:36:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-17 14:36:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-03-17 14:36:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:00,530 INFO L124 PetriNetUnfolderBase]: 6153/8833 cut-off events. [2025-03-17 14:36:00,530 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-03-17 14:36:00,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17748 conditions, 8833 events. 6153/8833 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 45289 event pairs, 3177 based on Foata normal form. 0/8077 useless extension candidates. Maximal degree in co-relation 17738. Up to 4776 conditions per place. [2025-03-17 14:36:00,555 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 34 selfloop transitions, 3 changer transitions 25/66 dead transitions. [2025-03-17 14:36:00,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 284 flow [2025-03-17 14:36:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:36:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:36:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-17 14:36:00,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3785310734463277 [2025-03-17 14:36:00,556 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 88 flow. Second operand 6 states and 134 transitions. [2025-03-17 14:36:00,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 284 flow [2025-03-17 14:36:00,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:36:00,558 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 101 flow [2025-03-17 14:36:00,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-03-17 14:36:00,558 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-03-17 14:36:00,558 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 101 flow [2025-03-17 14:36:00,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-17 14:36:00,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:00,559 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:00,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:36:00,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 14:36:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash -434980664, now seen corresponding path program 1 times [2025-03-17 14:36:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928014211] [2025-03-17 14:36:00,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:00,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:36:00,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:36:00,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:36:00,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:36:00,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:36:00,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:36:00,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:00,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:36:00,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:36:00,586 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-17 14:36:00,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:36:00,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:36:00,586 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 14:36:00,590 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:36:00,590 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 14:36:00,619 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:36:00,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 206 flow [2025-03-17 14:36:00,627 INFO L124 PetriNetUnfolderBase]: 15/109 cut-off events. [2025-03-17 14:36:00,628 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:36:00,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 109 events. 15/109 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 362 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 133. Up to 10 conditions per place. [2025-03-17 14:36:00,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 206 flow [2025-03-17 14:36:00,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 107 flow [2025-03-17 14:36:00,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:36:00,631 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;@7eaf688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:36:00,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:36:00,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:36:00,633 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-17 14:36:00,633 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:36:00,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:00,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:00,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-17 14:36:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 108810245, now seen corresponding path program 1 times [2025-03-17 14:36:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437423226] [2025-03-17 14:36:00,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:36:00,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:36:00,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:00,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:00,674 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-17 14:36:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:00,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437423226] [2025-03-17 14:36:00,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437423226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:00,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:36:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721300496] [2025-03-17 14:36:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:36:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:00,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:36:00,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:36:00,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-03-17 14:36:00,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-17 14:36:00,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:00,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-03-17 14:36:00,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:01,963 INFO L124 PetriNetUnfolderBase]: 21326/28642 cut-off events. [2025-03-17 14:36:01,964 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2025-03-17 14:36:01,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57517 conditions, 28642 events. 21326/28642 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 148567 event pairs, 15464 based on Foata normal form. 1992/29250 useless extension candidates. Maximal degree in co-relation 11990. Up to 27784 conditions per place. [2025-03-17 14:36:02,066 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 32 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-17 14:36:02,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 181 flow [2025-03-17 14:36:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:36:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:36:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-17 14:36:02,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2025-03-17 14:36:02,067 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 107 flow. Second operand 4 states and 98 transitions. [2025-03-17 14:36:02,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 181 flow [2025-03-17 14:36:02,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 174 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 14:36:02,075 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 108 flow [2025-03-17 14:36:02,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-03-17 14:36:02,076 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-03-17 14:36:02,076 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 108 flow [2025-03-17 14:36:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-17 14:36:02,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:02,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:36:02,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-17 14:36:02,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2125892062, now seen corresponding path program 1 times [2025-03-17 14:36:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382676469] [2025-03-17 14:36:02,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:02,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:36:02,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:36:02,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:02,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:02,102 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-17 14:36:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382676469] [2025-03-17 14:36:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382676469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:36:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277066544] [2025-03-17 14:36:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:02,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:36:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:02,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:36:02,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:36:02,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-03-17 14:36:02,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-17 14:36:02,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:02,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-03-17 14:36:02,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:03,235 INFO L124 PetriNetUnfolderBase]: 21326/28570 cut-off events. [2025-03-17 14:36:03,235 INFO L125 PetriNetUnfolderBase]: For 1055/1055 co-relation queries the response was YES. [2025-03-17 14:36:03,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57987 conditions, 28570 events. 21326/28570 cut-off events. For 1055/1055 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 147376 event pairs, 20306 based on Foata normal form. 0/27526 useless extension candidates. Maximal degree in co-relation 42651. Up to 27789 conditions per place. [2025-03-17 14:36:03,359 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 28 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:36:03,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 166 flow [2025-03-17 14:36:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:36:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:36:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-17 14:36:03,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-17 14:36:03,360 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 108 flow. Second operand 3 states and 75 transitions. [2025-03-17 14:36:03,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 166 flow [2025-03-17 14:36:03,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:36:03,362 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 102 flow [2025-03-17 14:36:03,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-03-17 14:36:03,362 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-03-17 14:36:03,362 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 102 flow [2025-03-17 14:36:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-17 14:36:03,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:03,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:36:03,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-17 14:36:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1092547843, now seen corresponding path program 1 times [2025-03-17 14:36:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376035176] [2025-03-17 14:36:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:03,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:36:03,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:36:03,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:03,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:03,428 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-17 14:36:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376035176] [2025-03-17 14:36:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376035176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:03,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:03,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:36:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471138320] [2025-03-17 14:36:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:36:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:03,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:36:03,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:36:03,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-03-17 14:36:03,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-17 14:36:03,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:03,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-03-17 14:36:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:04,876 INFO L124 PetriNetUnfolderBase]: 31817/41989 cut-off events. [2025-03-17 14:36:04,877 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2025-03-17 14:36:04,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84953 conditions, 41989 events. 31817/41989 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 219866 event pairs, 16809 based on Foata normal form. 0/38929 useless extension candidates. Maximal degree in co-relation 84942. Up to 23272 conditions per place. [2025-03-17 14:36:05,005 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 41 selfloop transitions, 3 changer transitions 31/79 dead transitions. [2025-03-17 14:36:05,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 342 flow [2025-03-17 14:36:05,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:36:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:36:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-03-17 14:36:05,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-17 14:36:05,006 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 102 flow. Second operand 6 states and 165 transitions. [2025-03-17 14:36:05,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 342 flow [2025-03-17 14:36:05,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:36:05,008 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 115 flow [2025-03-17 14:36:05,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-17 14:36:05,008 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-03-17 14:36:05,009 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 115 flow [2025-03-17 14:36:05,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-17 14:36:05,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:05,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:05,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:36:05,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-17 14:36:05,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 489769556, now seen corresponding path program 1 times [2025-03-17 14:36:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:05,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166282593] [2025-03-17 14:36:05,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:05,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:36:05,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:36:05,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:05,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:36:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166282593] [2025-03-17 14:36:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166282593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:05,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:36:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341267691] [2025-03-17 14:36:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:36:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:36:05,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:36:05,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-03-17 14:36:05,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-17 14:36:05,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:05,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-03-17 14:36:05,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:06,184 INFO L124 PetriNetUnfolderBase]: 21234/28546 cut-off events. [2025-03-17 14:36:06,184 INFO L125 PetriNetUnfolderBase]: For 6275/6275 co-relation queries the response was YES. [2025-03-17 14:36:06,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63843 conditions, 28546 events. 21234/28546 cut-off events. For 6275/6275 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 144111 event pairs, 10656 based on Foata normal form. 4/27542 useless extension candidates. Maximal degree in co-relation 63829. Up to 27586 conditions per place. [2025-03-17 14:36:06,291 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-03-17 14:36:06,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 227 flow [2025-03-17 14:36:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:36:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:36:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-17 14:36:06,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31466666666666665 [2025-03-17 14:36:06,292 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 115 flow. Second operand 5 states and 118 transitions. [2025-03-17 14:36:06,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 227 flow [2025-03-17 14:36:06,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 219 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-17 14:36:06,381 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 125 flow [2025-03-17 14:36:06,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-03-17 14:36:06,382 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2025-03-17 14:36:06,382 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 125 flow [2025-03-17 14:36:06,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-17 14:36:06,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:06,382 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:06,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:36:06,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-17 14:36:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -186815622, now seen corresponding path program 1 times [2025-03-17 14:36:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239566055] [2025-03-17 14:36:06,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:36:06,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:36:06,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:06,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:36:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:06,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239566055] [2025-03-17 14:36:06,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239566055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:06,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:06,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:36:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62075116] [2025-03-17 14:36:06,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:06,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:36:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:06,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:36:06,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:36:06,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2025-03-17 14:36:06,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 125 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-17 14:36:06,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:06,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2025-03-17 14:36:06,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:07,593 INFO L124 PetriNetUnfolderBase]: 20674/28866 cut-off events. [2025-03-17 14:36:07,593 INFO L125 PetriNetUnfolderBase]: For 3442/3442 co-relation queries the response was YES. [2025-03-17 14:36:07,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60808 conditions, 28866 events. 20674/28866 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 160511 event pairs, 6016 based on Foata normal form. 16/27922 useless extension candidates. Maximal degree in co-relation 60794. Up to 26530 conditions per place. [2025-03-17 14:36:07,707 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-03-17 14:36:07,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 281 flow [2025-03-17 14:36:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:36:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:36:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-17 14:36:07,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-03-17 14:36:07,708 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 125 flow. Second operand 6 states and 144 transitions. [2025-03-17 14:36:07,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 281 flow [2025-03-17 14:36:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 273 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 14:36:07,738 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 139 flow [2025-03-17 14:36:07,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-03-17 14:36:07,738 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2025-03-17 14:36:07,738 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 139 flow [2025-03-17 14:36:07,739 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-17 14:36:07,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:07,739 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:07,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:36:07,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-17 14:36:07,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1813258834, now seen corresponding path program 1 times [2025-03-17 14:36:07,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:07,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947341176] [2025-03-17 14:36:07,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:07,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:07,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:36:07,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:36:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:07,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:36:07,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:36:07,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:36:07,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:36:07,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:07,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:36:07,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:36:07,753 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-17 14:36:07,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-17 14:36:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:36:07,754 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 14:36:07,755 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:36:07,755 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 14:36:07,785 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:36:07,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 91 transitions, 262 flow [2025-03-17 14:36:07,792 INFO L124 PetriNetUnfolderBase]: 18/131 cut-off events. [2025-03-17 14:36:07,792 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 14:36:07,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 131 events. 18/131 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 437 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 163. Up to 12 conditions per place. [2025-03-17 14:36:07,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 91 transitions, 262 flow [2025-03-17 14:36:07,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 127 flow [2025-03-17 14:36:07,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:36:07,796 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;@7eaf688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:36:07,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 14:36:07,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:36:07,797 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-17 14:36:07,797 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:36:07,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:07,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:07,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 14:36:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1959375503, now seen corresponding path program 1 times [2025-03-17 14:36:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479013181] [2025-03-17 14:36:07,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:07,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:36:07,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:36:07,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:07,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:07,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-17 14:36:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479013181] [2025-03-17 14:36:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479013181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:36:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539710590] [2025-03-17 14:36:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:36:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:07,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:36:07,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:36:07,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-03-17 14:36:07,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 14:36:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:07,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-03-17 14:36:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:12,397 INFO L124 PetriNetUnfolderBase]: 104782/133618 cut-off events. [2025-03-17 14:36:12,397 INFO L125 PetriNetUnfolderBase]: For 7288/7288 co-relation queries the response was YES. [2025-03-17 14:36:12,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268990 conditions, 133618 events. 104782/133618 cut-off events. For 7288/7288 co-relation queries the response was YES. Maximal size of possible extension queue 3254. Compared 719153 event pairs, 81256 based on Foata normal form. 8136/136274 useless extension candidates. Maximal degree in co-relation 57524. Up to 130696 conditions per place. [2025-03-17 14:36:12,870 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-17 14:36:12,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 209 flow [2025-03-17 14:36:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:36:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:36:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-17 14:36:12,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3131868131868132 [2025-03-17 14:36:12,871 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 127 flow. Second operand 4 states and 114 transitions. [2025-03-17 14:36:12,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 209 flow [2025-03-17 14:36:12,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 196 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:36:12,921 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 122 flow [2025-03-17 14:36:12,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-03-17 14:36:12,922 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-17 14:36:12,922 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 122 flow [2025-03-17 14:36:12,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 14:36:12,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:12,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:12,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:36:12,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 14:36:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2086757311, now seen corresponding path program 1 times [2025-03-17 14:36:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791354440] [2025-03-17 14:36:12,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:12,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:36:12,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:36:12,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:12,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:12,937 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-17 14:36:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791354440] [2025-03-17 14:36:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791354440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:36:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155935821] [2025-03-17 14:36:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:12,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:36:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:12,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:36:12,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:36:12,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-03-17 14:36:12,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-17 14:36:12,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:12,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-03-17 14:36:12,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:18,236 INFO L124 PetriNetUnfolderBase]: 104782/133354 cut-off events. [2025-03-17 14:36:18,236 INFO L125 PetriNetUnfolderBase]: For 5026/5026 co-relation queries the response was YES. [2025-03-17 14:36:18,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270548 conditions, 133354 events. 104782/133354 cut-off events. For 5026/5026 co-relation queries the response was YES. Maximal size of possible extension queue 3286. Compared 714539 event pairs, 100690 based on Foata normal form. 0/129238 useless extension candidates. Maximal degree in co-relation 270504. Up to 130701 conditions per place. [2025-03-17 14:36:18,706 INFO L140 encePairwiseOnDemand]: 89/91 looper letters, 32 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-03-17 14:36:18,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 39 transitions, 188 flow [2025-03-17 14:36:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:36:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:36:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-17 14:36:18,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32234432234432236 [2025-03-17 14:36:18,707 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 122 flow. Second operand 3 states and 88 transitions. [2025-03-17 14:36:18,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 39 transitions, 188 flow [2025-03-17 14:36:18,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:36:18,712 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 116 flow [2025-03-17 14:36:18,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-03-17 14:36:18,712 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-03-17 14:36:18,712 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 116 flow [2025-03-17 14:36:18,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-17 14:36:18,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:18,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:36:18,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 14:36:18,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1257148196, now seen corresponding path program 1 times [2025-03-17 14:36:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875230682] [2025-03-17 14:36:18,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:18,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:36:18,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:36:18,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:18,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:18,754 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-17 14:36:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875230682] [2025-03-17 14:36:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875230682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:18,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:18,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:36:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197211111] [2025-03-17 14:36:18,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:18,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:36:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:18,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:36:18,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:36:18,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-03-17 14:36:18,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-17 14:36:18,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:18,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-03-17 14:36:18,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:36:25,786 INFO L124 PetriNetUnfolderBase]: 155977/196117 cut-off events. [2025-03-17 14:36:25,786 INFO L125 PetriNetUnfolderBase]: For 5025/5025 co-relation queries the response was YES. [2025-03-17 14:36:26,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396778 conditions, 196117 events. 155977/196117 cut-off events. For 5025/5025 co-relation queries the response was YES. Maximal size of possible extension queue 4177. Compared 1056374 event pairs, 83625 based on Foata normal form. 0/183841 useless extension candidates. Maximal degree in co-relation 396766. Up to 109544 conditions per place. [2025-03-17 14:36:26,393 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 48 selfloop transitions, 3 changer transitions 37/92 dead transitions. [2025-03-17 14:36:26,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 400 flow [2025-03-17 14:36:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:36:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:36:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-03-17 14:36:26,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2025-03-17 14:36:26,397 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 116 flow. Second operand 6 states and 196 transitions. [2025-03-17 14:36:26,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 400 flow [2025-03-17 14:36:26,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:36:26,403 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 129 flow [2025-03-17 14:36:26,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-03-17 14:36:26,404 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-03-17 14:36:26,404 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 129 flow [2025-03-17 14:36:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-17 14:36:26,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:36:26,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:36:26,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:36:26,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 14:36:26,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:36:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 315902805, now seen corresponding path program 1 times [2025-03-17 14:36:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:36:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351661390] [2025-03-17 14:36:26,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:36:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:36:26,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:36:26,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:36:26,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:36:26,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:36:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:36:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:36:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351661390] [2025-03-17 14:36:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351661390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:36:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:36:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:36:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028254465] [2025-03-17 14:36:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:36:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:36:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:36:26,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:36:26,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:36:26,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 91 [2025-03-17 14:36:26,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-17 14:36:26,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:36:26,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 91 [2025-03-17 14:36:26,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand