./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:10:19,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:19,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:19,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:19,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:19,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:19,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:19,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:19,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:19,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:19,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:19,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:19,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:19,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:19,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:19,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:19,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:19,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:19,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:19,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:19,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:19,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:19,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:19,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:19,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:19,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:19,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:19,600 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-03-04 10:10:19,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:19,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:19,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:19,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:19,872 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:19,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-04 10:10:21,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08907c4e/0cff1e61e29d404b837107e6f2271eab/FLAG9f14fe3b9 [2025-03-04 10:10:21,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:21,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-04 10:10:21,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08907c4e/0cff1e61e29d404b837107e6f2271eab/FLAG9f14fe3b9 [2025-03-04 10:10:21,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08907c4e/0cff1e61e29d404b837107e6f2271eab [2025-03-04 10:10:21,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:21,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:21,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:21,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:21,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:21,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6417b1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21, skipping insertion in model container [2025-03-04 10:10:21,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:21,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:21,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:21,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:21,544 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:21,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21 WrapperNode [2025-03-04 10:10:21,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:21,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:21,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:21,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:21,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,577 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2025-03-04 10:10:21,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:21,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:21,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:21,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:21,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,607 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-04 10:10:21,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:21,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:21,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:21,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:21,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (1/1) ... [2025-03-04 10:10:21,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:21,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:21,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:10:21,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:10:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:10:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:10:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:10:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:10:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:21,677 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:10:21,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:21,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:21,996 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:21,996 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:22,115 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:22,116 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:22,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:22 BoogieIcfgContainer [2025-03-04 10:10:22,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:22,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:22,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:22,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:22,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:21" (1/3) ... [2025-03-04 10:10:22,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5834c5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:22, skipping insertion in model container [2025-03-04 10:10:22,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:21" (2/3) ... [2025-03-04 10:10:22,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5834c5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:22, skipping insertion in model container [2025-03-04 10:10:22,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:22" (3/3) ... [2025-03-04 10:10:22,126 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-03-04 10:10:22,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:22,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 10:10:22,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:22,205 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:10:22,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2025-03-04 10:10:22,291 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2025-03-04 10:10:22,293 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:10:22,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 3/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-04 10:10:22,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2025-03-04 10:10:22,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2025-03-04 10:10:22,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:22,315 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;@2f98fa1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:22,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:10:22,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:22,336 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-03-04 10:10:22,336 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:10:22,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:22,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:22,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:22,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash -399463162, now seen corresponding path program 1 times [2025-03-04 10:10:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242500973] [2025-03-04 10:10:22,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:22,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:10:22,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:10:22,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:22,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:22,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242500973] [2025-03-04 10:10:22,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242500973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655053674] [2025-03-04 10:10:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:22,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:22,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:22,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:22,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:22,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:22,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:22,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:22,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:24,609 INFO L124 PetriNetUnfolderBase]: 17631/24113 cut-off events. [2025-03-04 10:10:24,611 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2025-03-04 10:10:24,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48642 conditions, 24113 events. 17631/24113 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 139494 event pairs, 6173 based on Foata normal form. 2/23349 useless extension candidates. Maximal degree in co-relation 45351. Up to 14774 conditions per place. [2025-03-04 10:10:24,771 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2025-03-04 10:10:24,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2025-03-04 10:10:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-04 10:10:24,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-03-04 10:10:24,785 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 123 transitions. [2025-03-04 10:10:24,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2025-03-04 10:10:24,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:10:24,823 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-03-04 10:10:24,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-04 10:10:24,828 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-03-04 10:10:24,828 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-03-04 10:10:24,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:24,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:24,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:24,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:24,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1213452540, now seen corresponding path program 1 times [2025-03-04 10:10:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813431423] [2025-03-04 10:10:24,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:24,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:24,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813431423] [2025-03-04 10:10:25,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813431423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:25,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:25,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:25,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543979695] [2025-03-04 10:10:25,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:25,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:25,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:25,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 61 [2025-03-04 10:10:25,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:25,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:25,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 61 [2025-03-04 10:10:25,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:26,735 INFO L124 PetriNetUnfolderBase]: 24981/33967 cut-off events. [2025-03-04 10:10:26,735 INFO L125 PetriNetUnfolderBase]: For 2715/2715 co-relation queries the response was YES. [2025-03-04 10:10:26,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72786 conditions, 33967 events. 24981/33967 cut-off events. For 2715/2715 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 196070 event pairs, 17656 based on Foata normal form. 0/33386 useless extension candidates. Maximal degree in co-relation 41623. Up to 29158 conditions per place. [2025-03-04 10:10:26,854 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 73 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2025-03-04 10:10:26,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 386 flow [2025-03-04 10:10:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-04 10:10:26,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2025-03-04 10:10:26,856 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 108 transitions. [2025-03-04 10:10:26,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 386 flow [2025-03-04 10:10:26,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:26,861 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-03-04 10:10:26,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-03-04 10:10:26,862 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-03-04 10:10:26,862 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-03-04 10:10:26,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:26,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:26,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:26,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash -796837414, now seen corresponding path program 1 times [2025-03-04 10:10:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:26,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308243048] [2025-03-04 10:10:26,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:26,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:26,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:26,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:26,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308243048] [2025-03-04 10:10:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308243048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:27,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:27,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127498155] [2025-03-04 10:10:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:27,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:27,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:27,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:27,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:27,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:27,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:27,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:27,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:29,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [5#L56-3true, Black: 78#true, 8#L100-1true, 26#L66-3true, 85#(<= ~s~0 ~t~0), 28#thread4EXITtrue, 80#(not (= ~x~0 1)), 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-03-04 10:10:29,154 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-04 10:10:29,154 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:10:29,154 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:10:29,154 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:10:29,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [5#L56-3true, Black: 78#true, 26#L66-3true, 85#(<= ~s~0 ~t~0), 80#(not (= ~x~0 1)), 28#thread4EXITtrue, 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0), 55#L101true]) [2025-03-04 10:10:29,414 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-04 10:10:29,414 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:10:29,414 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:10:29,414 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:10:29,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L66-3-->L66: Formula: (and (= |v_thread3Thread1of1ForFork2_#t~post6#1_1| v_~s~0_43) (= v_~s~0_42 (+ |v_thread3Thread1of1ForFork2_#t~post6#1_1| 1))) InVars {~s~0=v_~s~0_43} OutVars{thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_1|, ~s~0=v_~s~0_42} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post6#1, ~s~0][94], [5#L56-3true, 40#L76-3true, Black: 78#true, 83#true, 80#(not (= ~x~0 1)), 12#L66true, 47#L102true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-03-04 10:10:29,521 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 10:10:29,521 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 10:10:29,521 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:10:29,521 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:10:29,564 INFO L124 PetriNetUnfolderBase]: 41500/59187 cut-off events. [2025-03-04 10:10:29,564 INFO L125 PetriNetUnfolderBase]: For 18035/18063 co-relation queries the response was YES. [2025-03-04 10:10:29,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133896 conditions, 59187 events. 41500/59187 cut-off events. For 18035/18063 co-relation queries the response was YES. Maximal size of possible extension queue 2605. Compared 415594 event pairs, 11478 based on Foata normal form. 596/58470 useless extension candidates. Maximal degree in co-relation 75815. Up to 20854 conditions per place. [2025-03-04 10:10:29,805 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 120 selfloop transitions, 19 changer transitions 2/155 dead transitions. [2025-03-04 10:10:29,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 155 transitions, 743 flow [2025-03-04 10:10:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2025-03-04 10:10:29,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6786885245901639 [2025-03-04 10:10:29,811 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 5 states and 207 transitions. [2025-03-04 10:10:29,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 155 transitions, 743 flow [2025-03-04 10:10:29,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 155 transitions, 715 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:29,893 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 290 flow [2025-03-04 10:10:29,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2025-03-04 10:10:29,894 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-04 10:10:29,894 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 290 flow [2025-03-04 10:10:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:29,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:29,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:10:29,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1049569032, now seen corresponding path program 2 times [2025-03-04 10:10:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445420845] [2025-03-04 10:10:29,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:29,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:29,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:29,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:29,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445420845] [2025-03-04 10:10:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445420845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855061227] [2025-03-04 10:10:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:30,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:30,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:30,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:30,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:30,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:30,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:30,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:30,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:32,605 INFO L124 PetriNetUnfolderBase]: 39254/56975 cut-off events. [2025-03-04 10:10:32,605 INFO L125 PetriNetUnfolderBase]: For 32333/32415 co-relation queries the response was YES. [2025-03-04 10:10:32,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149659 conditions, 56975 events. 39254/56975 cut-off events. For 32333/32415 co-relation queries the response was YES. Maximal size of possible extension queue 2495. Compared 410945 event pairs, 10100 based on Foata normal form. 652/56136 useless extension candidates. Maximal degree in co-relation 86838. Up to 19444 conditions per place. [2025-03-04 10:10:32,851 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 24 changer transitions 3/157 dead transitions. [2025-03-04 10:10:32,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 157 transitions, 836 flow [2025-03-04 10:10:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-03-04 10:10:32,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-03-04 10:10:32,854 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 290 flow. Second operand 5 states and 204 transitions. [2025-03-04 10:10:32,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 157 transitions, 836 flow [2025-03-04 10:10:32,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 157 transitions, 836 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:10:32,861 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 391 flow [2025-03-04 10:10:32,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2025-03-04 10:10:32,862 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2025-03-04 10:10:32,862 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 391 flow [2025-03-04 10:10:32,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:32,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:32,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:32,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:10:32,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:32,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 771122282, now seen corresponding path program 3 times [2025-03-04 10:10:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705271973] [2025-03-04 10:10:32,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:10:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:32,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:32,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:32,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:10:32,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705271973] [2025-03-04 10:10:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705271973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:33,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:33,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:10:33,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056110562] [2025-03-04 10:10:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:33,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:10:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:33,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:10:33,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:10:33,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:33,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:33,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:33,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:33,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:36,009 INFO L124 PetriNetUnfolderBase]: 37618/55592 cut-off events. [2025-03-04 10:10:36,009 INFO L125 PetriNetUnfolderBase]: For 51708/51729 co-relation queries the response was YES. [2025-03-04 10:10:36,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158109 conditions, 55592 events. 37618/55592 cut-off events. For 51708/51729 co-relation queries the response was YES. Maximal size of possible extension queue 2551. Compared 412893 event pairs, 7640 based on Foata normal form. 338/54391 useless extension candidates. Maximal degree in co-relation 103941. Up to 21496 conditions per place. [2025-03-04 10:10:36,317 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 134 selfloop transitions, 61 changer transitions 7/216 dead transitions. [2025-03-04 10:10:36,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 216 transitions, 1323 flow [2025-03-04 10:10:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-03-04 10:10:36,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6693989071038251 [2025-03-04 10:10:36,319 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 391 flow. Second operand 6 states and 245 transitions. [2025-03-04 10:10:36,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 216 transitions, 1323 flow [2025-03-04 10:10:36,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 216 transitions, 1277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:36,345 INFO L231 Difference]: Finished difference. Result has 78 places, 120 transitions, 800 flow [2025-03-04 10:10:36,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=800, PETRI_PLACES=78, PETRI_TRANSITIONS=120} [2025-03-04 10:10:36,346 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2025-03-04 10:10:36,346 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 120 transitions, 800 flow [2025-03-04 10:10:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:36,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:36,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:10:36,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:36,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1456228624, now seen corresponding path program 4 times [2025-03-04 10:10:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107579331] [2025-03-04 10:10:36,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:36,357 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 10:10:36,369 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:36,370 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:36,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107579331] [2025-03-04 10:10:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107579331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958371816] [2025-03-04 10:10:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:36,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:36,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:36,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:36,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 120 transitions, 800 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:36,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:36,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:39,326 INFO L124 PetriNetUnfolderBase]: 32806/48702 cut-off events. [2025-03-04 10:10:39,326 INFO L125 PetriNetUnfolderBase]: For 91699/91761 co-relation queries the response was YES. [2025-03-04 10:10:39,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154386 conditions, 48702 events. 32806/48702 cut-off events. For 91699/91761 co-relation queries the response was YES. Maximal size of possible extension queue 2093. Compared 356526 event pairs, 8665 based on Foata normal form. 396/48031 useless extension candidates. Maximal degree in co-relation 108913. Up to 22365 conditions per place. [2025-03-04 10:10:39,595 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 130 selfloop transitions, 47 changer transitions 13/204 dead transitions. [2025-03-04 10:10:39,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 204 transitions, 1563 flow [2025-03-04 10:10:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-03-04 10:10:39,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6655737704918033 [2025-03-04 10:10:39,597 INFO L175 Difference]: Start difference. First operand has 78 places, 120 transitions, 800 flow. Second operand 5 states and 203 transitions. [2025-03-04 10:10:39,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 204 transitions, 1563 flow [2025-03-04 10:10:39,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 204 transitions, 1549 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-04 10:10:39,674 INFO L231 Difference]: Finished difference. Result has 84 places, 129 transitions, 1017 flow [2025-03-04 10:10:39,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1017, PETRI_PLACES=84, PETRI_TRANSITIONS=129} [2025-03-04 10:10:39,675 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2025-03-04 10:10:39,675 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 129 transitions, 1017 flow [2025-03-04 10:10:39,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:39,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:39,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:39,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:10:39,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1900597092, now seen corresponding path program 5 times [2025-03-04 10:10:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158655914] [2025-03-04 10:10:39,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:10:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:39,685 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:39,694 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:39,695 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158655914] [2025-03-04 10:10:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158655914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:39,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:10:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303492389] [2025-03-04 10:10:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:39,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:10:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:39,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:10:39,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:10:39,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:39,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 129 transitions, 1017 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:39,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:39,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:39,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:42,130 INFO L124 PetriNetUnfolderBase]: 28563/41983 cut-off events. [2025-03-04 10:10:42,130 INFO L125 PetriNetUnfolderBase]: For 98595/98723 co-relation queries the response was YES. [2025-03-04 10:10:42,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142260 conditions, 41983 events. 28563/41983 cut-off events. For 98595/98723 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 297398 event pairs, 6315 based on Foata normal form. 450/41258 useless extension candidates. Maximal degree in co-relation 98150. Up to 16082 conditions per place. [2025-03-04 10:10:42,354 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 133 selfloop transitions, 72 changer transitions 11/230 dead transitions. [2025-03-04 10:10:42,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 230 transitions, 1878 flow [2025-03-04 10:10:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2025-03-04 10:10:42,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:10:42,355 INFO L175 Difference]: Start difference. First operand has 84 places, 129 transitions, 1017 flow. Second operand 6 states and 244 transitions. [2025-03-04 10:10:42,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 230 transitions, 1878 flow [2025-03-04 10:10:42,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 230 transitions, 1815 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:42,420 INFO L231 Difference]: Finished difference. Result has 88 places, 132 transitions, 1172 flow [2025-03-04 10:10:42,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1172, PETRI_PLACES=88, PETRI_TRANSITIONS=132} [2025-03-04 10:10:42,421 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 22 predicate places. [2025-03-04 10:10:42,421 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 132 transitions, 1172 flow [2025-03-04 10:10:42,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:42,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:42,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:42,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:10:42,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1840055250, now seen corresponding path program 6 times [2025-03-04 10:10:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107591155] [2025-03-04 10:10:42,422 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:42,428 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:42,433 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:42,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:10:42,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:42,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:42,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107591155] [2025-03-04 10:10:42,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107591155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:42,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:42,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863386822] [2025-03-04 10:10:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:42,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:42,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:42,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:42,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 132 transitions, 1172 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:42,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:42,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:42,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:45,430 INFO L124 PetriNetUnfolderBase]: 29093/43103 cut-off events. [2025-03-04 10:10:45,430 INFO L125 PetriNetUnfolderBase]: For 130644/130754 co-relation queries the response was YES. [2025-03-04 10:10:45,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152821 conditions, 43103 events. 29093/43103 cut-off events. For 130644/130754 co-relation queries the response was YES. Maximal size of possible extension queue 1995. Compared 309916 event pairs, 6852 based on Foata normal form. 453/42365 useless extension candidates. Maximal degree in co-relation 106076. Up to 16053 conditions per place. [2025-03-04 10:10:45,706 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 159 selfloop transitions, 91 changer transitions 6/270 dead transitions. [2025-03-04 10:10:45,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 270 transitions, 2384 flow [2025-03-04 10:10:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2025-03-04 10:10:45,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2025-03-04 10:10:45,708 INFO L175 Difference]: Start difference. First operand has 88 places, 132 transitions, 1172 flow. Second operand 8 states and 312 transitions. [2025-03-04 10:10:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 270 transitions, 2384 flow [2025-03-04 10:10:45,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 270 transitions, 2195 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:10:45,820 INFO L231 Difference]: Finished difference. Result has 92 places, 151 transitions, 1487 flow [2025-03-04 10:10:45,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1487, PETRI_PLACES=92, PETRI_TRANSITIONS=151} [2025-03-04 10:10:45,821 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 26 predicate places. [2025-03-04 10:10:45,821 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 151 transitions, 1487 flow [2025-03-04 10:10:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:45,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:45,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:45,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:10:45,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:45,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash 664964088, now seen corresponding path program 1 times [2025-03-04 10:10:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:45,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-03-04 10:10:45,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:45,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:45,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:45,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:45,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-03-04 10:10:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204947320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:45,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582299970] [2025-03-04 10:10:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:45,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:45,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:45,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:45,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:45,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 151 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:45,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:45,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:45,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:48,469 INFO L124 PetriNetUnfolderBase]: 25572/38349 cut-off events. [2025-03-04 10:10:48,470 INFO L125 PetriNetUnfolderBase]: For 114743/114811 co-relation queries the response was YES. [2025-03-04 10:10:48,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136419 conditions, 38349 events. 25572/38349 cut-off events. For 114743/114811 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 277142 event pairs, 6181 based on Foata normal form. 738/38103 useless extension candidates. Maximal degree in co-relation 98236. Up to 14423 conditions per place. [2025-03-04 10:10:48,691 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 154 selfloop transitions, 98 changer transitions 29/295 dead transitions. [2025-03-04 10:10:48,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 295 transitions, 2797 flow [2025-03-04 10:10:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 316 transitions. [2025-03-04 10:10:48,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2025-03-04 10:10:48,693 INFO L175 Difference]: Start difference. First operand has 92 places, 151 transitions, 1487 flow. Second operand 8 states and 316 transitions. [2025-03-04 10:10:48,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 295 transitions, 2797 flow [2025-03-04 10:10:48,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 295 transitions, 2654 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:48,806 INFO L231 Difference]: Finished difference. Result has 98 places, 158 transitions, 1681 flow [2025-03-04 10:10:48,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1681, PETRI_PLACES=98, PETRI_TRANSITIONS=158} [2025-03-04 10:10:48,807 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2025-03-04 10:10:48,807 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 158 transitions, 1681 flow [2025-03-04 10:10:48,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:48,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:48,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:48,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:10:48,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:48,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2071737390, now seen corresponding path program 7 times [2025-03-04 10:10:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:48,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084412609] [2025-03-04 10:10:48,808 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:10:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:48,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:48,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:48,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:48,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:48,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084412609] [2025-03-04 10:10:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084412609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:48,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:48,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625905441] [2025-03-04 10:10:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:48,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:48,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:48,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:48,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:48,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 158 transitions, 1681 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:48,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:48,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:48,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:51,061 INFO L124 PetriNetUnfolderBase]: 18461/28357 cut-off events. [2025-03-04 10:10:51,062 INFO L125 PetriNetUnfolderBase]: For 90454/90522 co-relation queries the response was YES. [2025-03-04 10:10:51,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102225 conditions, 28357 events. 18461/28357 cut-off events. For 90454/90522 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 202328 event pairs, 4723 based on Foata normal form. 276/28119 useless extension candidates. Maximal degree in co-relation 79535. Up to 10430 conditions per place. [2025-03-04 10:10:51,165 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 134 selfloop transitions, 108 changer transitions 27/283 dead transitions. [2025-03-04 10:10:51,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 283 transitions, 3009 flow [2025-03-04 10:10:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-04 10:10:51,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168032786885246 [2025-03-04 10:10:51,166 INFO L175 Difference]: Start difference. First operand has 98 places, 158 transitions, 1681 flow. Second operand 8 states and 301 transitions. [2025-03-04 10:10:51,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 283 transitions, 3009 flow [2025-03-04 10:10:51,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 283 transitions, 2964 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:51,243 INFO L231 Difference]: Finished difference. Result has 105 places, 166 transitions, 2031 flow [2025-03-04 10:10:51,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2031, PETRI_PLACES=105, PETRI_TRANSITIONS=166} [2025-03-04 10:10:51,243 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2025-03-04 10:10:51,243 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 166 transitions, 2031 flow [2025-03-04 10:10:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:51,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:51,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:10:51,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1280601850, now seen corresponding path program 8 times [2025-03-04 10:10:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:51,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592610064] [2025-03-04 10:10:51,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:51,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:51,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:51,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:51,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592610064] [2025-03-04 10:10:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592610064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:10:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328470957] [2025-03-04 10:10:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:51,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:10:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:51,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:10:51,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:10:51,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:51,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 166 transitions, 2031 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:51,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:51,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:51,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:53,355 INFO L124 PetriNetUnfolderBase]: 17882/27502 cut-off events. [2025-03-04 10:10:53,355 INFO L125 PetriNetUnfolderBase]: For 104699/104715 co-relation queries the response was YES. [2025-03-04 10:10:53,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100733 conditions, 27502 events. 17882/27502 cut-off events. For 104699/104715 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 195903 event pairs, 4541 based on Foata normal form. 64/27036 useless extension candidates. Maximal degree in co-relation 76758. Up to 10550 conditions per place. [2025-03-04 10:10:53,517 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 140 changer transitions 17/287 dead transitions. [2025-03-04 10:10:53,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 287 transitions, 3333 flow [2025-03-04 10:10:53,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2025-03-04 10:10:53,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5840163934426229 [2025-03-04 10:10:53,518 INFO L175 Difference]: Start difference. First operand has 105 places, 166 transitions, 2031 flow. Second operand 8 states and 285 transitions. [2025-03-04 10:10:53,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 287 transitions, 3333 flow [2025-03-04 10:10:53,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 287 transitions, 3274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:53,650 INFO L231 Difference]: Finished difference. Result has 111 places, 192 transitions, 2611 flow [2025-03-04 10:10:53,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2611, PETRI_PLACES=111, PETRI_TRANSITIONS=192} [2025-03-04 10:10:53,650 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 45 predicate places. [2025-03-04 10:10:53,650 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 192 transitions, 2611 flow [2025-03-04 10:10:53,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:53,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:53,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:53,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:10:53,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1736607420, now seen corresponding path program 9 times [2025-03-04 10:10:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239809283] [2025-03-04 10:10:53,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:10:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:53,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:53,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:53,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:10:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239809283] [2025-03-04 10:10:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239809283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:10:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053901385] [2025-03-04 10:10:53,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:10:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:53,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:10:53,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:10:53,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:53,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 192 transitions, 2611 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:53,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:53,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:53,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:56,002 INFO L124 PetriNetUnfolderBase]: 16869/25955 cut-off events. [2025-03-04 10:10:56,002 INFO L125 PetriNetUnfolderBase]: For 122667/122679 co-relation queries the response was YES. [2025-03-04 10:10:56,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97660 conditions, 25955 events. 16869/25955 cut-off events. For 122667/122679 co-relation queries the response was YES. Maximal size of possible extension queue 1156. Compared 183912 event pairs, 4275 based on Foata normal form. 316/25737 useless extension candidates. Maximal degree in co-relation 73484. Up to 9744 conditions per place. [2025-03-04 10:10:56,139 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 151 selfloop transitions, 146 changer transitions 29/340 dead transitions. [2025-03-04 10:10:56,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 340 transitions, 4060 flow [2025-03-04 10:10:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:10:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:10:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 400 transitions. [2025-03-04 10:10:56,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546448087431694 [2025-03-04 10:10:56,141 INFO L175 Difference]: Start difference. First operand has 111 places, 192 transitions, 2611 flow. Second operand 12 states and 400 transitions. [2025-03-04 10:10:56,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 340 transitions, 4060 flow [2025-03-04 10:10:56,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 340 transitions, 3823 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-03-04 10:10:56,288 INFO L231 Difference]: Finished difference. Result has 119 places, 198 transitions, 2784 flow [2025-03-04 10:10:56,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2784, PETRI_PLACES=119, PETRI_TRANSITIONS=198} [2025-03-04 10:10:56,288 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2025-03-04 10:10:56,288 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 198 transitions, 2784 flow [2025-03-04 10:10:56,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:56,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:56,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:56,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:10:56,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:56,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash -105139074, now seen corresponding path program 10 times [2025-03-04 10:10:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370433722] [2025-03-04 10:10:56,289 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:56,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 10:10:56,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:56,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:56,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:56,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370433722] [2025-03-04 10:10:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370433722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:56,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:56,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:10:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912901966] [2025-03-04 10:10:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:56,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:10:56,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:56,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:10:56,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:10:56,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:56,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 198 transitions, 2784 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:56,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:56,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:56,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,902 INFO L124 PetriNetUnfolderBase]: 16973/26202 cut-off events. [2025-03-04 10:10:58,903 INFO L125 PetriNetUnfolderBase]: For 151353/151365 co-relation queries the response was YES. [2025-03-04 10:10:58,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103111 conditions, 26202 events. 16973/26202 cut-off events. For 151353/151365 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 187114 event pairs, 4598 based on Foata normal form. 120/25776 useless extension candidates. Maximal degree in co-relation 77307. Up to 9989 conditions per place. [2025-03-04 10:10:59,042 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 121 selfloop transitions, 122 changer transitions 71/328 dead transitions. [2025-03-04 10:10:59,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 328 transitions, 4159 flow [2025-03-04 10:10:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:10:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:10:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 390 transitions. [2025-03-04 10:10:59,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5327868852459017 [2025-03-04 10:10:59,043 INFO L175 Difference]: Start difference. First operand has 119 places, 198 transitions, 2784 flow. Second operand 12 states and 390 transitions. [2025-03-04 10:10:59,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 328 transitions, 4159 flow [2025-03-04 10:10:59,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 328 transitions, 4027 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:59,222 INFO L231 Difference]: Finished difference. Result has 129 places, 174 transitions, 2450 flow [2025-03-04 10:10:59,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2666, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2450, PETRI_PLACES=129, PETRI_TRANSITIONS=174} [2025-03-04 10:10:59,223 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 63 predicate places. [2025-03-04 10:10:59,223 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 174 transitions, 2450 flow [2025-03-04 10:10:59,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:59,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:59,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:10:59,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:10:59,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash 868381400, now seen corresponding path program 2 times [2025-03-04 10:10:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139846482] [2025-03-04 10:10:59,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:59,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:10:59,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:10:59,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:59,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139846482] [2025-03-04 10:10:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139846482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:59,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:10:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076361848] [2025-03-04 10:10:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:59,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:10:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:59,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:10:59,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:10:59,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-04 10:10:59,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 174 transitions, 2450 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:59,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-04 10:10:59,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand