./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:37:48,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:37:48,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:37:48,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:37:48,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:37:48,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:37:48,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:37:48,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:37:48,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:37:48,477 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:37:48,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:37:48,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:37:48,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:37:48,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:37:48,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:48,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:37:48,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-02-06 12:37:48,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:37:48,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:37:48,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:37:48,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:37:48,716 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:37:48,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-02-06 12:37:49,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834b370aa/ac9a8b461c424714a46c59ea27ef3e45/FLAG939988918 [2025-02-06 12:37:50,302 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:37:50,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-02-06 12:37:50,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834b370aa/ac9a8b461c424714a46c59ea27ef3e45/FLAG939988918 [2025-02-06 12:37:50,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834b370aa/ac9a8b461c424714a46c59ea27ef3e45 [2025-02-06 12:37:50,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:37:50,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:37:50,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:50,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:37:50,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:37:50,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad90b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50, skipping insertion in model container [2025-02-06 12:37:50,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:37:50,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:50,767 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:37:50,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:50,815 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:37:50,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50 WrapperNode [2025-02-06 12:37:50,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:50,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:50,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:37:50,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:37:50,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,837 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-02-06 12:37:50,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:50,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:37:50,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:37:50,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:37:50,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,850 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-02-06 12:37:50,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:37:50,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:37:50,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:37:50,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:37:50,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (1/1) ... [2025-02-06 12:37:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:50,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:37:50,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:37:50,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:37:50,901 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:37:50,902 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:37:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:37:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:37:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:37:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:37:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:37:50,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:37:50,903 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:37:50,985 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:37:50,987 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:37:51,087 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:37:51,087 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:37:51,141 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:37:51,141 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:37:51,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:51 BoogieIcfgContainer [2025-02-06 12:37:51,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:37:51,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:37:51,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:37:51,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:37:51,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:37:50" (1/3) ... [2025-02-06 12:37:51,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:51, skipping insertion in model container [2025-02-06 12:37:51,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:50" (2/3) ... [2025-02-06 12:37:51,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:51, skipping insertion in model container [2025-02-06 12:37:51,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:51" (3/3) ... [2025-02-06 12:37:51,148 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-02-06 12:37:51,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:37:51,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 12 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-06 12:37:51,164 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:37:51,200 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:51,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 12 transitions, 28 flow [2025-02-06 12:37:51,239 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-02-06 12:37:51,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:51,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 12:37:51,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 12 transitions, 28 flow [2025-02-06 12:37:51,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 12 transitions, 28 flow [2025-02-06 12:37:51,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:51,271 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;@43c24ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:51,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 12:37:51,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:51,275 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:51,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:51,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:51,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:51,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:37:51,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 115407, now seen corresponding path program 1 times [2025-02-06 12:37:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882522989] [2025-02-06 12:37:51,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:51,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:51,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:51,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:51,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882522989] [2025-02-06 12:37:51,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882522989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:51,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:51,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092821405] [2025-02-06 12:37:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:51,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:51,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:51,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 12 [2025-02-06 12:37:51,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:51,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 12 [2025-02-06 12:37:51,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:51,479 INFO L124 PetriNetUnfolderBase]: 5/20 cut-off events. [2025-02-06 12:37:51,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:51,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 20 events. 5/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 5 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 32. Up to 20 conditions per place. [2025-02-06 12:37:51,485 INFO L140 encePairwiseOnDemand]: 11/12 looper letters, 8 selfloop transitions, 0 changer transitions 0/9 dead transitions. [2025-02-06 12:37:51,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 9 transitions, 38 flow [2025-02-06 12:37:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2025-02-06 12:37:51,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 12:37:51,499 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 2 states and 13 transitions. [2025-02-06 12:37:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 9 transitions, 38 flow [2025-02-06 12:37:51,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 9 transitions, 38 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:51,503 INFO L231 Difference]: Finished difference. Result has 13 places, 9 transitions, 22 flow [2025-02-06 12:37:51,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=22, PETRI_PLACES=13, PETRI_TRANSITIONS=9} [2025-02-06 12:37:51,507 INFO L279 CegarLoopForPetriNet]: 15 programPoint places, -2 predicate places. [2025-02-06 12:37:51,508 INFO L471 AbstractCegarLoop]: Abstraction has has 13 places, 9 transitions, 22 flow [2025-02-06 12:37:51,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:51,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 12:37:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:37:51,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:37:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 110954310, now seen corresponding path program 1 times [2025-02-06 12:37:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230987531] [2025-02-06 12:37:51,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:51,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:51,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:51,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:51,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:51,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:51,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:51,547 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:51,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-06 12:37:51,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-06 12:37:51,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-02-06 12:37:51,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-02-06 12:37:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:37:51,551 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:37:51,554 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:51,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:37:51,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:51,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2025-02-06 12:37:51,579 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-06 12:37:51,579 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:37:51,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-02-06 12:37:51,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2025-02-06 12:37:51,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2025-02-06 12:37:51,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:51,581 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;@43c24ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:51,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 12:37:51,582 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:51,582 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:51,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:51,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:51,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:51,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 133281, now seen corresponding path program 1 times [2025-02-06 12:37:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743393990] [2025-02-06 12:37:51,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:51,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:51,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:51,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743393990] [2025-02-06 12:37:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743393990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:51,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:51,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476649250] [2025-02-06 12:37:51,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:51,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:51,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:51,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:51,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:51,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2025-02-06 12:37:51,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:51,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2025-02-06 12:37:51,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:51,659 INFO L124 PetriNetUnfolderBase]: 95/183 cut-off events. [2025-02-06 12:37:51,660 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 12:37:51,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 183 events. 95/183 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 587 event pairs, 95 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 256. Up to 182 conditions per place. [2025-02-06 12:37:51,662 INFO L140 encePairwiseOnDemand]: 17/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-02-06 12:37:51,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 68 flow [2025-02-06 12:37:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 19 transitions. [2025-02-06 12:37:51,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-02-06 12:37:51,663 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 2 states and 19 transitions. [2025-02-06 12:37:51,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 68 flow [2025-02-06 12:37:51,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:51,664 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 40 flow [2025-02-06 12:37:51,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-02-06 12:37:51,665 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2025-02-06 12:37:51,665 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 40 flow [2025-02-06 12:37:51,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:51,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:37:51,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:37:51,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:51,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash -322724700, now seen corresponding path program 1 times [2025-02-06 12:37:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244034835] [2025-02-06 12:37:51,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:51,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:37:51,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:37:51,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:51,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244034835] [2025-02-06 12:37:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244034835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:51,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:51,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:51,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482925565] [2025-02-06 12:37:51,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:51,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:51,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:51,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:51,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2025-02-06 12:37:51,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:51,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2025-02-06 12:37:51,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:51,772 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2025-02-06 12:37:51,772 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 12:37:51,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 796 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 445. Up to 116 conditions per place. [2025-02-06 12:37:51,774 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-02-06 12:37:51,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 109 flow [2025-02-06 12:37:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-02-06 12:37:51,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 12:37:51,775 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 40 flow. Second operand 3 states and 30 transitions. [2025-02-06 12:37:51,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 109 flow [2025-02-06 12:37:51,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:51,777 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 62 flow [2025-02-06 12:37:51,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2025-02-06 12:37:51,778 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-02-06 12:37:51,778 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2025-02-06 12:37:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:51,779 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-02-06 12:37:51,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:37:51,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:51,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1414763855, now seen corresponding path program 1 times [2025-02-06 12:37:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107933493] [2025-02-06 12:37:51,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:51,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:37:51,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:37:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:51,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:51,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:37:51,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:37:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:51,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:51,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:51,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 12:37:51,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 12:37:51,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-06 12:37:51,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-02-06 12:37:51,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-06 12:37:51,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:37:51,800 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:51,801 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:51,801 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:37:51,833 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 66 flow [2025-02-06 12:37:51,839 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-02-06 12:37:51,839 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:37:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-02-06 12:37:51,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 24 transitions, 66 flow [2025-02-06 12:37:51,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 66 flow [2025-02-06 12:37:51,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:51,841 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;@43c24ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:51,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:37:51,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:51,842 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:51,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:51,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:51,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:51,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 157113, now seen corresponding path program 1 times [2025-02-06 12:37:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793916063] [2025-02-06 12:37:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:51,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:51,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:51,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793916063] [2025-02-06 12:37:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793916063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:51,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055365661] [2025-02-06 12:37:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:51,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:51,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:51,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:51,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-02-06 12:37:51,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:51,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:51,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-02-06 12:37:51,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:51,989 INFO L124 PetriNetUnfolderBase]: 995/1523 cut-off events. [2025-02-06 12:37:51,989 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-06 12:37:51,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 1523 events. 995/1523 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6369 event pairs, 995 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 632. Up to 1514 conditions per place. [2025-02-06 12:37:52,005 INFO L140 encePairwiseOnDemand]: 23/24 looper letters, 20 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-02-06 12:37:52,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 100 flow [2025-02-06 12:37:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2025-02-06 12:37:52,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-02-06 12:37:52,008 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 2 states and 25 transitions. [2025-02-06 12:37:52,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 100 flow [2025-02-06 12:37:52,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 98 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:52,011 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-02-06 12:37:52,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-02-06 12:37:52,012 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2025-02-06 12:37:52,013 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-02-06 12:37:52,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:52,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:52,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:37:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:37:52,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 387427199, now seen corresponding path program 1 times [2025-02-06 12:37:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996978134] [2025-02-06 12:37:52,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:52,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:37:52,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:37:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:52,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996978134] [2025-02-06 12:37:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996978134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645892803] [2025-02-06 12:37:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:52,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:52,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:52,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:52,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-02-06 12:37:52,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:52,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:52,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-02-06 12:37:52,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:52,270 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2025-02-06 12:37:52,270 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-02-06 12:37:52,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 2070 events. 1343/2070 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10048 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 4288. Up to 1272 conditions per place. [2025-02-06 12:37:52,284 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-02-06 12:37:52,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 168 flow [2025-02-06 12:37:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-02-06 12:37:52,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 12:37:52,285 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 58 flow. Second operand 3 states and 42 transitions. [2025-02-06 12:37:52,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 168 flow [2025-02-06 12:37:52,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:52,287 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 88 flow [2025-02-06 12:37:52,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-02-06 12:37:52,287 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-02-06 12:37:52,287 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 88 flow [2025-02-06 12:37:52,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:52,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:52,288 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:52,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:37:52,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:52,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1351669296, now seen corresponding path program 1 times [2025-02-06 12:37:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949033434] [2025-02-06 12:37:52,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:52,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:37:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:37:52,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:52,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949033434] [2025-02-06 12:37:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949033434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606636593] [2025-02-06 12:37:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:52,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:52,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:52,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2025-02-06 12:37:52,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:52,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:52,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2025-02-06 12:37:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:52,592 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2025-02-06 12:37:52,592 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-02-06 12:37:52,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13557 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 6311. Up to 1546 conditions per place. [2025-02-06 12:37:52,612 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2025-02-06 12:37:52,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 221 flow [2025-02-06 12:37:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-02-06 12:37:52,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-02-06 12:37:52,614 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 88 flow. Second operand 3 states and 41 transitions. [2025-02-06 12:37:52,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 221 flow [2025-02-06 12:37:52,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:37:52,622 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2025-02-06 12:37:52,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-02-06 12:37:52,623 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-02-06 12:37:52,623 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2025-02-06 12:37:52,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:52,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:52,623 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-02-06 12:37:52,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:37:52,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:52,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1047543917, now seen corresponding path program 1 times [2025-02-06 12:37:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650098526] [2025-02-06 12:37:52,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:52,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:52,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:52,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:52,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:52,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:52,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:52,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:52,640 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:52,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 12:37:52,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:37:52,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:37:52,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-06 12:37:52,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-06 12:37:52,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:37:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:37:52,641 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 12:37:52,641 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:52,641 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:37:52,657 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:52,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 88 flow [2025-02-06 12:37:52,661 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-02-06 12:37:52,661 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:37:52,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 0/46 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 119 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-02-06 12:37:52,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 30 transitions, 88 flow [2025-02-06 12:37:52,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 88 flow [2025-02-06 12:37:52,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:52,662 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;@43c24ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:52,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:37:52,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:52,663 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:52,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:52,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:52,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:52,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:52,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 186903, now seen corresponding path program 1 times [2025-02-06 12:37:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971107890] [2025-02-06 12:37:52,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:52,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:52,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:52,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:52,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971107890] [2025-02-06 12:37:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971107890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554650429] [2025-02-06 12:37:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:52,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:52,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-02-06 12:37:52,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:52,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:52,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-02-06 12:37:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:53,396 INFO L124 PetriNetUnfolderBase]: 8555/11725 cut-off events. [2025-02-06 12:37:53,397 INFO L125 PetriNetUnfolderBase]: For 2706/2706 co-relation queries the response was YES. [2025-02-06 12:37:53,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24640 conditions, 11725 events. 8555/11725 cut-off events. For 2706/2706 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 56148 event pairs, 8555 based on Foata normal form. 0/9755 useless extension candidates. Maximal degree in co-relation 3241. Up to 11666 conditions per place. [2025-02-06 12:37:53,455 INFO L140 encePairwiseOnDemand]: 29/30 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-02-06 12:37:53,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 134 flow [2025-02-06 12:37:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2025-02-06 12:37:53,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-02-06 12:37:53,457 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 88 flow. Second operand 2 states and 31 transitions. [2025-02-06 12:37:53,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 134 flow [2025-02-06 12:37:53,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 128 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:53,459 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 76 flow [2025-02-06 12:37:53,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-02-06 12:37:53,460 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-02-06 12:37:53,460 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 76 flow [2025-02-06 12:37:53,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:53,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:53,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:37:53,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:37:53,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:53,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1275084799, now seen corresponding path program 1 times [2025-02-06 12:37:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396996944] [2025-02-06 12:37:53,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:53,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:37:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:37:53,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:53,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:53,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396996944] [2025-02-06 12:37:53,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396996944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993423525] [2025-02-06 12:37:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:53,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:53,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:53,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:53,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-02-06 12:37:53,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:53,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:53,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-02-06 12:37:53,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:54,343 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2025-02-06 12:37:54,343 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2025-02-06 12:37:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34713 conditions, 16840 events. 12243/16840 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90108 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 34706. Up to 10936 conditions per place. [2025-02-06 12:37:54,431 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-02-06 12:37:54,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 227 flow [2025-02-06 12:37:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-02-06 12:37:54,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 12:37:54,437 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 76 flow. Second operand 3 states and 54 transitions. [2025-02-06 12:37:54,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 227 flow [2025-02-06 12:37:54,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:54,440 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 114 flow [2025-02-06 12:37:54,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-02-06 12:37:54,442 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-02-06 12:37:54,443 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 114 flow [2025-02-06 12:37:54,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:54,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:54,443 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:54,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:37:54,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1279143211, now seen corresponding path program 1 times [2025-02-06 12:37:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836627970] [2025-02-06 12:37:54,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:54,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:37:54,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:37:54,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:54,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836627970] [2025-02-06 12:37:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836627970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585634760] [2025-02-06 12:37:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:54,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:54,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:54,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-02-06 12:37:54,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:54,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:54,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-02-06 12:37:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:55,545 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2025-02-06 12:37:55,545 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2025-02-06 12:37:55,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55877 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 133453 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 55868. Up to 15062 conditions per place. [2025-02-06 12:37:55,667 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-02-06 12:37:55,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 300 flow [2025-02-06 12:37:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-02-06 12:37:55,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-02-06 12:37:55,668 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 114 flow. Second operand 3 states and 53 transitions. [2025-02-06 12:37:55,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 300 flow [2025-02-06 12:37:55,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:37:55,708 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 172 flow [2025-02-06 12:37:55,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=104, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-02-06 12:37:55,709 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2025-02-06 12:37:55,709 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 172 flow [2025-02-06 12:37:55,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:55,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:55,709 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:37:55,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:55,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash 879553378, now seen corresponding path program 1 times [2025-02-06 12:37:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105288407] [2025-02-06 12:37:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:55,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:37:55,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:37:55,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:55,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105288407] [2025-02-06 12:37:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105288407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:55,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:55,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370691239] [2025-02-06 12:37:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:55,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:55,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:55,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:55,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-02-06 12:37:55,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:55,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:55,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-02-06 12:37:55,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:57,057 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2025-02-06 12:37:57,057 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2025-02-06 12:37:57,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79821 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185263 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 79811. Up to 19502 conditions per place. [2025-02-06 12:37:57,266 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-02-06 12:37:57,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 409 flow [2025-02-06 12:37:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-02-06 12:37:57,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-02-06 12:37:57,267 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 172 flow. Second operand 3 states and 52 transitions. [2025-02-06 12:37:57,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 409 flow [2025-02-06 12:37:57,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:37:57,336 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 278 flow [2025-02-06 12:37:57,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-02-06 12:37:57,337 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2025-02-06 12:37:57,338 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 278 flow [2025-02-06 12:37:57,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:57,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:57,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:57,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:37:57,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 558748989, now seen corresponding path program 1 times [2025-02-06 12:37:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:57,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745133548] [2025-02-06 12:37:57,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:37:57,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:37:57,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:57,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:57,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745133548] [2025-02-06 12:37:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745133548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:57,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:57,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:37:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439930543] [2025-02-06 12:37:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:37:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:57,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:37:57,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:37:57,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-02-06 12:37:57,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:57,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:57,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-02-06 12:37:57,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:59,919 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2025-02-06 12:37:59,920 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2025-02-06 12:38:00,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150160 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 356832 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150149. Up to 16776 conditions per place. [2025-02-06 12:38:00,217 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2025-02-06 12:38:00,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 147 transitions, 1084 flow [2025-02-06 12:38:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:38:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:38:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-02-06 12:38:00,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 12:38:00,222 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 278 flow. Second operand 6 states and 120 transitions. [2025-02-06 12:38:00,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 147 transitions, 1084 flow [2025-02-06 12:38:00,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:38:00,392 INFO L231 Difference]: Finished difference. Result has 52 places, 70 transitions, 575 flow [2025-02-06 12:38:00,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=52, PETRI_TRANSITIONS=70} [2025-02-06 12:38:00,392 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2025-02-06 12:38:00,393 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 70 transitions, 575 flow [2025-02-06 12:38:00,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:00,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:00,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:38:00,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:38:00,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:38:00,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 895800519, now seen corresponding path program 2 times [2025-02-06 12:38:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769700920] [2025-02-06 12:38:00,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:38:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:00,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:38:00,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:38:00,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:38:00,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:38:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:38:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:38:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769700920] [2025-02-06 12:38:00,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769700920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:38:00,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:38:00,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:38:00,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070626309] [2025-02-06 12:38:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:38:00,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:38:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:38:00,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:38:00,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:38:00,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-02-06 12:38:00,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:00,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:38:00,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-02-06 12:38:00,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:38:03,512 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2025-02-06 12:38:03,513 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2025-02-06 12:38:03,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183312 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404707 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 183297. Up to 19534 conditions per place. [2025-02-06 12:38:03,891 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2025-02-06 12:38:03,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 179 transitions, 1515 flow [2025-02-06 12:38:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:38:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:38:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-02-06 12:38:03,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-06 12:38:03,893 INFO L175 Difference]: Start difference. First operand has 52 places, 70 transitions, 575 flow. Second operand 7 states and 135 transitions. [2025-02-06 12:38:03,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 179 transitions, 1515 flow [2025-02-06 12:38:04,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:38:04,347 INFO L231 Difference]: Finished difference. Result has 62 places, 95 transitions, 1039 flow [2025-02-06 12:38:04,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=62, PETRI_TRANSITIONS=95} [2025-02-06 12:38:04,348 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2025-02-06 12:38:04,348 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 95 transitions, 1039 flow [2025-02-06 12:38:04,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:04,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:04,348 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-02-06 12:38:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:38:04,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:38:04,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1496283706, now seen corresponding path program 1 times [2025-02-06 12:38:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:04,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13406638] [2025-02-06 12:38:04,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:38:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:04,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:38:04,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:38:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:38:04,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:38:04,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:38:04,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:38:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:38:04,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:38:04,369 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:38:04,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:38:04,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:38:04,370 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-02-06 12:38:04,371 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:38:04,371 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 12:38:04,394 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:38:04,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 112 flow [2025-02-06 12:38:04,401 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-02-06 12:38:04,402 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 12:38:04,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 56 events. 0/56 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-02-06 12:38:04,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 36 transitions, 112 flow [2025-02-06 12:38:04,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 112 flow [2025-02-06 12:38:04,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:38:04,404 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;@43c24ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:38:04,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:38:04,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:38:04,405 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:38:04,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:38:04,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:04,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:38:04,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:38:04,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 222651, now seen corresponding path program 1 times [2025-02-06 12:38:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844988152] [2025-02-06 12:38:04,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:38:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:04,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:38:04,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:38:04,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:04,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:38:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:38:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:38:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844988152] [2025-02-06 12:38:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844988152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:38:04,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:38:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:38:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492341134] [2025-02-06 12:38:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:38:04,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:38:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:38:04,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:38:04,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:38:04,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-02-06 12:38:04,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:04,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:38:04,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-02-06 12:38:04,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:38:07,800 INFO L124 PetriNetUnfolderBase]: 66875/85897 cut-off events. [2025-02-06 12:38:07,801 INFO L125 PetriNetUnfolderBase]: For 25086/25086 co-relation queries the response was YES. [2025-02-06 12:38:07,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180461 conditions, 85897 events. 66875/85897 cut-off events. For 25086/25086 co-relation queries the response was YES. Maximal size of possible extension queue 2281. Compared 444543 event pairs, 66875 based on Foata normal form. 0/70967 useless extension candidates. Maximal degree in co-relation 24891. Up to 85538 conditions per place. [2025-02-06 12:38:08,376 INFO L140 encePairwiseOnDemand]: 35/36 looper letters, 32 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-02-06 12:38:08,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 170 flow [2025-02-06 12:38:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:38:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:38:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2025-02-06 12:38:08,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-02-06 12:38:08,378 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 112 flow. Second operand 2 states and 37 transitions. [2025-02-06 12:38:08,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 170 flow [2025-02-06 12:38:08,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 33 transitions, 158 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-06 12:38:08,384 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 94 flow [2025-02-06 12:38:08,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-02-06 12:38:08,384 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-02-06 12:38:08,384 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 94 flow [2025-02-06 12:38:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:08,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:08,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:38:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:38:08,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:38:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1954734091, now seen corresponding path program 1 times [2025-02-06 12:38:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843621205] [2025-02-06 12:38:08,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:38:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:38:08,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:38:08,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:08,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:38:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:38:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:38:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843621205] [2025-02-06 12:38:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843621205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:38:08,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:38:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:38:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659503793] [2025-02-06 12:38:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:38:08,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:38:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:38:08,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:38:08,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:38:08,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-02-06 12:38:08,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:08,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:38:08,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-02-06 12:38:08,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:38:13,169 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2025-02-06 12:38:13,170 INFO L125 PetriNetUnfolderBase]: For 11167/11167 co-relation queries the response was YES. [2025-02-06 12:38:13,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258461 conditions, 126043 events. 97851/126043 cut-off events. For 11167/11167 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 715857 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 258453. Up to 84136 conditions per place. [2025-02-06 12:38:14,011 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-02-06 12:38:14,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 286 flow [2025-02-06 12:38:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:38:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:38:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 12:38:14,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-06 12:38:14,013 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 94 flow. Second operand 3 states and 66 transitions. [2025-02-06 12:38:14,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 286 flow [2025-02-06 12:38:14,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:38:14,026 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 140 flow [2025-02-06 12:38:14,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-02-06 12:38:14,027 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-02-06 12:38:14,027 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 140 flow [2025-02-06 12:38:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:14,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:14,027 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:38:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:38:14,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:38:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1605515790, now seen corresponding path program 1 times [2025-02-06 12:38:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697828996] [2025-02-06 12:38:14,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:38:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:14,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:38:14,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:38:14,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:14,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:38:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:38:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:38:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697828996] [2025-02-06 12:38:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697828996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:38:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:38:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:38:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039322097] [2025-02-06 12:38:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:38:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:38:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:38:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:38:14,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:38:14,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2025-02-06 12:38:14,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:14,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:38:14,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2025-02-06 12:38:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand