./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/exponential-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/exponential-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:32:25,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:32:25,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:32:25,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:32:25,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:32:25,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:32:25,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:32:25,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:32:25,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:32:25,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:32:25,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:32:25,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:32:25,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:32:25,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:32:25,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:32:25,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:25,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:32:25,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 [2025-03-09 01:32:26,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:32:26,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:32:26,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:32:26,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:32:26,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:32:26,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-4.i [2025-03-09 01:32:27,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d788886/f6ed755b03e649c9b189fb6b6209f763/FLAGbeb9176a5 [2025-03-09 01:32:27,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:32:27,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i [2025-03-09 01:32:27,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d788886/f6ed755b03e649c9b189fb6b6209f763/FLAGbeb9176a5 [2025-03-09 01:32:27,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d788886/f6ed755b03e649c9b189fb6b6209f763 [2025-03-09 01:32:27,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:32:27,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:32:27,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:27,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:32:27,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:32:27,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:27,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2028a775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27, skipping insertion in model container [2025-03-09 01:32:27,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:27,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:32:27,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:27,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:32:27,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:27,970 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:32:27,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27 WrapperNode [2025-03-09 01:32:27,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:27,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:27,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:32:27,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:32:27,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:27,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:27,997 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2025-03-09 01:32:27,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:27,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:32:27,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:32:27,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:32:28,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,016 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:32:28,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:32:28,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:32:28,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:32:28,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:32:28,029 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (1/1) ... [2025-03-09 01:32:28,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:28,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:28,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:32:28,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:32:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:32:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-09 01:32:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-09 01:32:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-09 01:32:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-09 01:32:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:32:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:32:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:32:28,072 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:32:28,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:32:28,176 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:32:28,309 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:32:28,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:32:28,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:32:28,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:32:28,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:28 BoogieIcfgContainer [2025-03-09 01:32:28,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:32:28,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:32:28,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:32:28,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:32:28,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:32:27" (1/3) ... [2025-03-09 01:32:28,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a66d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:28, skipping insertion in model container [2025-03-09 01:32:28,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:27" (2/3) ... [2025-03-09 01:32:28,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a66d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:28, skipping insertion in model container [2025-03-09 01:32:28,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:28" (3/3) ... [2025-03-09 01:32:28,412 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-4.i [2025-03-09 01:32:28,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:32:28,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-4.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 01:32:28,427 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:32:28,465 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:32:28,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-03-09 01:32:28,514 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-09 01:32:28,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:28,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 6/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-03-09 01:32:28,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-03-09 01:32:28,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 57 flow [2025-03-09 01:32:28,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:28,539 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;@69b47907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:28,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:32:28,545 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:28,546 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-09 01:32:28,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:28,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:28,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:32:28,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:28,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash 984343300, now seen corresponding path program 1 times [2025-03-09 01:32:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627082038] [2025-03-09 01:32:28,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:28,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:32:28,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:32:28,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627082038] [2025-03-09 01:32:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627082038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:28,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328652002] [2025-03-09 01:32:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:28,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:28,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:28,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-09 01:32:28,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:28,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-09 01:32:28,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:28,832 INFO L124 PetriNetUnfolderBase]: 89/196 cut-off events. [2025-03-09 01:32:28,832 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:32:28,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 196 events. 89/196 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 788 event pairs, 38 based on Foata normal form. 18/192 useless extension candidates. Maximal degree in co-relation 353. Up to 136 conditions per place. [2025-03-09 01:32:28,836 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 18 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-09 01:32:28,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 101 flow [2025-03-09 01:32:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-09 01:32:28,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2025-03-09 01:32:28,846 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 57 flow. Second operand 3 states and 47 transitions. [2025-03-09 01:32:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 101 flow [2025-03-09 01:32:28,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:28,851 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 58 flow [2025-03-09 01:32:28,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2025-03-09 01:32:28,854 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-03-09 01:32:28,855 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 58 flow [2025-03-09 01:32:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:28,855 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:28,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:32:28,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:28,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 577732193, now seen corresponding path program 1 times [2025-03-09 01:32:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:28,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692582051] [2025-03-09 01:32:28,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:32:28,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:32:28,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:28,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:28,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:32:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:32:28,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:28,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:28,907 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:28,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-09 01:32:28,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-09 01:32:28,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-09 01:32:28,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-09 01:32:28,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:32:28,910 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 01:32:28,913 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:32:28,913 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:32:28,936 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:32:28,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 90 flow [2025-03-09 01:32:28,949 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2025-03-09 01:32:28,950 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:32:28,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 64 events. 9/64 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 53. Up to 6 conditions per place. [2025-03-09 01:32:28,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 90 flow [2025-03-09 01:32:28,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2025-03-09 01:32:28,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:28,952 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;@69b47907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:28,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:32:28,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:28,958 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-09 01:32:28,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:28,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:28,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:32:28,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2019764260, now seen corresponding path program 1 times [2025-03-09 01:32:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196956668] [2025-03-09 01:32:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:32:28,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:32:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196956668] [2025-03-09 01:32:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196956668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987361379] [2025-03-09 01:32:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:29,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:29,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:29,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:29,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-09 01:32:29,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:29,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-09 01:32:29,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:29,341 INFO L124 PetriNetUnfolderBase]: 1718/2746 cut-off events. [2025-03-09 01:32:29,341 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-03-09 01:32:29,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5278 conditions, 2746 events. 1718/2746 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15829 event pairs, 728 based on Foata normal form. 180/2718 useless extension candidates. Maximal degree in co-relation 1448. Up to 2386 conditions per place. [2025-03-09 01:32:29,364 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 26 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:32:29,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 148 flow [2025-03-09 01:32:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-09 01:32:29,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-09 01:32:29,367 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 3 states and 61 transitions. [2025-03-09 01:32:29,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 148 flow [2025-03-09 01:32:29,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:29,371 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 89 flow [2025-03-09 01:32:29,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-03-09 01:32:29,372 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-09 01:32:29,372 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 89 flow [2025-03-09 01:32:29,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:29,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:29,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:32:29,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -331783497, now seen corresponding path program 1 times [2025-03-09 01:32:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938769813] [2025-03-09 01:32:29,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:29,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:32:29,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:32:29,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938769813] [2025-03-09 01:32:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938769813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432561480] [2025-03-09 01:32:29,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:29,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:29,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:29,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:29,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-09 01:32:29,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:29,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-09 01:32:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:29,711 INFO L124 PetriNetUnfolderBase]: 1946/2971 cut-off events. [2025-03-09 01:32:29,711 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2025-03-09 01:32:29,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 2971 events. 1946/2971 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16352 event pairs, 1628 based on Foata normal form. 0/2853 useless extension candidates. Maximal degree in co-relation 2398. Up to 2410 conditions per place. [2025-03-09 01:32:29,730 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 28 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-09 01:32:29,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 169 flow [2025-03-09 01:32:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-09 01:32:29,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-09 01:32:29,731 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 89 flow. Second operand 4 states and 71 transitions. [2025-03-09 01:32:29,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 169 flow [2025-03-09 01:32:29,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:29,734 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 101 flow [2025-03-09 01:32:29,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-03-09 01:32:29,735 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-03-09 01:32:29,735 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 101 flow [2025-03-09 01:32:29,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:29,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:29,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:32:29,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1696361286, now seen corresponding path program 1 times [2025-03-09 01:32:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557154309] [2025-03-09 01:32:29,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:29,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:29,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:29,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557154309] [2025-03-09 01:32:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557154309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852566144] [2025-03-09 01:32:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:29,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:29,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:29,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-09 01:32:29,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:29,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-09 01:32:29,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:29,959 INFO L124 PetriNetUnfolderBase]: 1946/2926 cut-off events. [2025-03-09 01:32:29,959 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2025-03-09 01:32:29,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6410 conditions, 2926 events. 1946/2926 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15663 event pairs, 1856 based on Foata normal form. 90/2898 useless extension candidates. Maximal degree in co-relation 2367. Up to 2728 conditions per place. [2025-03-09 01:32:29,976 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 21 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-03-09 01:32:29,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 145 flow [2025-03-09 01:32:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-09 01:32:29,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-09 01:32:29,977 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 101 flow. Second operand 3 states and 49 transitions. [2025-03-09 01:32:29,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 145 flow [2025-03-09 01:32:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 139 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:29,982 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 93 flow [2025-03-09 01:32:29,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-03-09 01:32:29,983 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2025-03-09 01:32:29,984 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 93 flow [2025-03-09 01:32:29,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:29,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:29,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:32:29,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:29,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1696360475, now seen corresponding path program 1 times [2025-03-09 01:32:29,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:29,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448772833] [2025-03-09 01:32:29,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:29,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:30,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:30,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448772833] [2025-03-09 01:32:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448772833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478137191] [2025-03-09 01:32:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:30,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:30,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:30,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:30,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-09 01:32:30,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:30,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:30,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-09 01:32:30,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:30,245 INFO L124 PetriNetUnfolderBase]: 1661/2671 cut-off events. [2025-03-09 01:32:30,245 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-09 01:32:30,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 2671 events. 1661/2671 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15289 event pairs, 80 based on Foata normal form. 9/2589 useless extension candidates. Maximal degree in co-relation 5516. Up to 1864 conditions per place. [2025-03-09 01:32:30,263 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 34 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-03-09 01:32:30,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 197 flow [2025-03-09 01:32:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-09 01:32:30,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-09 01:32:30,265 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 93 flow. Second operand 4 states and 77 transitions. [2025-03-09 01:32:30,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 197 flow [2025-03-09 01:32:30,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:30,272 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 102 flow [2025-03-09 01:32:30,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2025-03-09 01:32:30,274 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-03-09 01:32:30,274 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 102 flow [2025-03-09 01:32:30,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:30,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:30,274 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:30,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:32:30,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:30,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1299091189, now seen corresponding path program 1 times [2025-03-09 01:32:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:30,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431110661] [2025-03-09 01:32:30,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:30,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:32:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:32:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:30,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:30,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:32:30,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:32:30,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:30,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:30,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:30,308 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:30,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-09 01:32:30,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-09 01:32:30,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-09 01:32:30,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-09 01:32:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:32:30,311 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-09 01:32:30,311 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:32:30,311 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:32:30,331 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:32:30,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 122 flow [2025-03-09 01:32:30,337 INFO L124 PetriNetUnfolderBase]: 12/88 cut-off events. [2025-03-09 01:32:30,338 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-09 01:32:30,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 88 events. 12/88 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 228 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 85. Up to 8 conditions per place. [2025-03-09 01:32:30,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 43 transitions, 122 flow [2025-03-09 01:32:30,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 41 transitions, 115 flow [2025-03-09 01:32:30,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:30,340 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;@69b47907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:30,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:32:30,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:30,342 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-09 01:32:30,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:30,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:30,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:32:30,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1003114428, now seen corresponding path program 1 times [2025-03-09 01:32:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594034563] [2025-03-09 01:32:30,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:30,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:32:30,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:32:30,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:30,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:30,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594034563] [2025-03-09 01:32:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594034563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689775307] [2025-03-09 01:32:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:30,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:30,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:30,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-03-09 01:32:30,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:30,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:30,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-03-09 01:32:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:32,278 INFO L124 PetriNetUnfolderBase]: 23831/32149 cut-off events. [2025-03-09 01:32:32,278 INFO L125 PetriNetUnfolderBase]: For 2551/2551 co-relation queries the response was YES. [2025-03-09 01:32:32,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63681 conditions, 32149 events. 23831/32149 cut-off events. For 2551/2551 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 192331 event pairs, 18830 based on Foata normal form. 1638/31893 useless extension candidates. Maximal degree in co-relation 18431. Up to 30088 conditions per place. [2025-03-09 01:32:32,444 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 32 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-03-09 01:32:32,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 191 flow [2025-03-09 01:32:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 01:32:32,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2025-03-09 01:32:32,446 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 115 flow. Second operand 3 states and 73 transitions. [2025-03-09 01:32:32,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 191 flow [2025-03-09 01:32:32,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:32,456 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 116 flow [2025-03-09 01:32:32,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-03-09 01:32:32,458 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-09 01:32:32,458 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 116 flow [2025-03-09 01:32:32,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:32,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:32,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:32,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:32:32,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:32,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1806650575, now seen corresponding path program 1 times [2025-03-09 01:32:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008515321] [2025-03-09 01:32:32,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:32,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:32:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:32:32,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008515321] [2025-03-09 01:32:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008515321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:32,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:32,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177694831] [2025-03-09 01:32:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:32,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:32,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:32,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-03-09 01:32:32,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:32,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:32,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-03-09 01:32:32,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:34,340 INFO L124 PetriNetUnfolderBase]: 26975/36118 cut-off events. [2025-03-09 01:32:34,341 INFO L125 PetriNetUnfolderBase]: For 2441/2441 co-relation queries the response was YES. [2025-03-09 01:32:34,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72938 conditions, 36118 events. 26975/36118 cut-off events. For 2441/2441 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 216514 event pairs, 23012 based on Foata normal form. 0/35028 useless extension candidates. Maximal degree in co-relation 21152. Up to 30112 conditions per place. [2025-03-09 01:32:34,543 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 38 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2025-03-09 01:32:34,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 224 flow [2025-03-09 01:32:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-09 01:32:34,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174418604651163 [2025-03-09 01:32:34,546 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 116 flow. Second operand 4 states and 89 transitions. [2025-03-09 01:32:34,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 224 flow [2025-03-09 01:32:34,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:34,550 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 128 flow [2025-03-09 01:32:34,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-03-09 01:32:34,551 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-09 01:32:34,551 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 128 flow [2025-03-09 01:32:34,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:34,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:34,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:32:34,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:34,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 170585549, now seen corresponding path program 1 times [2025-03-09 01:32:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967322288] [2025-03-09 01:32:34,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:34,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:34,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:34,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:34,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:34,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967322288] [2025-03-09 01:32:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967322288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191157275] [2025-03-09 01:32:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:34,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:34,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:34,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:34,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-09 01:32:34,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:34,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:34,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-09 01:32:34,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:36,290 INFO L124 PetriNetUnfolderBase]: 26975/35749 cut-off events. [2025-03-09 01:32:36,290 INFO L125 PetriNetUnfolderBase]: For 5975/5975 co-relation queries the response was YES. [2025-03-09 01:32:36,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76657 conditions, 35749 events. 26975/35749 cut-off events. For 5975/5975 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 208391 event pairs, 26156 based on Foata normal form. 819/35478 useless extension candidates. Maximal degree in co-relation 29358. Up to 34075 conditions per place. [2025-03-09 01:32:36,578 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 27 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-03-09 01:32:36,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 184 flow [2025-03-09 01:32:36,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-09 01:32:36,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2025-03-09 01:32:36,580 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 128 flow. Second operand 3 states and 61 transitions. [2025-03-09 01:32:36,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 184 flow [2025-03-09 01:32:36,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 39 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:36,667 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 120 flow [2025-03-09 01:32:36,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-03-09 01:32:36,668 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-03-09 01:32:36,668 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 120 flow [2025-03-09 01:32:36,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:36,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:36,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:32:36,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 170586360, now seen corresponding path program 1 times [2025-03-09 01:32:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327086628] [2025-03-09 01:32:36,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:36,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:36,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:36,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:36,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327086628] [2025-03-09 01:32:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327086628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402287593] [2025-03-09 01:32:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:36,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:36,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-03-09 01:32:36,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:36,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:36,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-03-09 01:32:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:38,158 INFO L124 PetriNetUnfolderBase]: 23774/32452 cut-off events. [2025-03-09 01:32:38,158 INFO L125 PetriNetUnfolderBase]: For 3581/3581 co-relation queries the response was YES. [2025-03-09 01:32:38,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67630 conditions, 32452 events. 23774/32452 cut-off events. For 3581/3581 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 198058 event pairs, 10556 based on Foata normal form. 9/31371 useless extension candidates. Maximal degree in co-relation 67616. Up to 29566 conditions per place. [2025-03-09 01:32:38,501 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-09 01:32:38,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 246 flow [2025-03-09 01:32:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-09 01:32:38,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5406976744186046 [2025-03-09 01:32:38,502 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 120 flow. Second operand 4 states and 93 transitions. [2025-03-09 01:32:38,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 246 flow [2025-03-09 01:32:38,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:38,557 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 135 flow [2025-03-09 01:32:38,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2025-03-09 01:32:38,558 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-09 01:32:38,558 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 135 flow [2025-03-09 01:32:38,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:38,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:38,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:38,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:32:38,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash -735291583, now seen corresponding path program 1 times [2025-03-09 01:32:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:38,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266762558] [2025-03-09 01:32:38,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:38,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:32:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:32:38,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266762558] [2025-03-09 01:32:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266762558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:32:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723158400] [2025-03-09 01:32:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:32:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:32:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:32:38,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-03-09 01:32:38,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:38,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:38,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-03-09 01:32:38,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:39,869 INFO L124 PetriNetUnfolderBase]: 22829/31936 cut-off events. [2025-03-09 01:32:39,870 INFO L125 PetriNetUnfolderBase]: For 4534/4534 co-relation queries the response was YES. [2025-03-09 01:32:39,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67152 conditions, 31936 events. 22829/31936 cut-off events. For 4534/4534 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 203701 event pairs, 824 based on Foata normal form. 81/31197 useless extension candidates. Maximal degree in co-relation 67136. Up to 22600 conditions per place. [2025-03-09 01:32:40,057 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 54 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-03-09 01:32:40,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 309 flow [2025-03-09 01:32:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:32:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:32:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-09 01:32:40,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2025-03-09 01:32:40,059 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 135 flow. Second operand 5 states and 118 transitions. [2025-03-09 01:32:40,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 309 flow [2025-03-09 01:32:40,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 303 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:40,146 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 141 flow [2025-03-09 01:32:40,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-03-09 01:32:40,147 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-03-09 01:32:40,147 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 141 flow [2025-03-09 01:32:40,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:40,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:40,147 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:40,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:32:40,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1370084175, now seen corresponding path program 1 times [2025-03-09 01:32:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:40,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837345379] [2025-03-09 01:32:40,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:40,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:32:40,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:32:40,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:40,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:40,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:40,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:32:40,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:32:40,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:40,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:40,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:40,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-09 01:32:40,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-09 01:32:40,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-09 01:32:40,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-09 01:32:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:32:40,178 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 01:32:40,179 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:32:40,179 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 01:32:40,203 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:32:40,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 51 transitions, 158 flow [2025-03-09 01:32:40,212 INFO L124 PetriNetUnfolderBase]: 15/112 cut-off events. [2025-03-09 01:32:40,212 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 01:32:40,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 112 events. 15/112 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 273 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 119. Up to 10 conditions per place. [2025-03-09 01:32:40,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 51 transitions, 158 flow [2025-03-09 01:32:40,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 49 transitions, 150 flow [2025-03-09 01:32:40,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:40,214 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;@69b47907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:40,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:32:40,215 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:40,216 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-09 01:32:40,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:40,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:40,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:32:40,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:32:40,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash 505641828, now seen corresponding path program 1 times [2025-03-09 01:32:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674993798] [2025-03-09 01:32:40,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:40,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:32:40,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:32:40,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:40,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:40,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674993798] [2025-03-09 01:32:40,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674993798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315814998] [2025-03-09 01:32:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:40,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:40,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:40,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:40,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2025-03-09 01:32:40,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:40,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:40,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2025-03-09 01:32:40,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:58,067 INFO L124 PetriNetUnfolderBase]: 289916/364816 cut-off events. [2025-03-09 01:32:58,068 INFO L125 PetriNetUnfolderBase]: For 42985/42985 co-relation queries the response was YES. [2025-03-09 01:32:59,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727316 conditions, 364816 events. 289916/364816 cut-off events. For 42985/42985 co-relation queries the response was YES. Maximal size of possible extension queue 11429. Compared 2288837 event pairs, 207116 based on Foata normal form. 14760/362376 useless extension candidates. Maximal degree in co-relation 217286. Up to 346474 conditions per place. [2025-03-09 01:33:00,528 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 38 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-03-09 01:33:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 238 flow [2025-03-09 01:33:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:33:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:33:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-09 01:33:00,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 01:33:00,530 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 150 flow. Second operand 3 states and 85 transitions. [2025-03-09 01:33:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 238 flow [2025-03-09 01:33:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 225 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:33:00,924 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 143 flow [2025-03-09 01:33:00,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-03-09 01:33:00,925 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-03-09 01:33:00,925 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 143 flow [2025-03-09 01:33:00,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:33:00,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:33:00,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:33:00,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:33:00,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:33:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:33:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash -888122897, now seen corresponding path program 1 times [2025-03-09 01:33:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:33:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370416948] [2025-03-09 01:33:00,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:33:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:33:00,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:33:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:33:00,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:00,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:33:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:33:00,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:33:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370416948] [2025-03-09 01:33:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370416948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:33:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:33:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:33:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836894494] [2025-03-09 01:33:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:33:00,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:33:00,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:33:00,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:33:00,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:33:00,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2025-03-09 01:33:00,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:33:00,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:33:00,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2025-03-09 01:33:00,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand