./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/exponential-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/exponential-64.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:16:20,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:16:20,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:16:20,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:16:20,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:16:20,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:16:20,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:16:20,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:16:20,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:16:20,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:16:20,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:16:20,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:16:20,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:16:20,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:16:20,953 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:16:20,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:16:20,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:16:20,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:16:20,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:16:20,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:20,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:20,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:20,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:16:20,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc [2025-01-10 01:16:21,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:16:21,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:16:21,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:16:21,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:16:21,227 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:16:21,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-64.i [2025-01-10 01:16:22,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36e3324da/a3a8a713b02f4266a49b947d1d78f030/FLAG2ca20a921 [2025-01-10 01:16:22,816 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:16:22,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-64.i [2025-01-10 01:16:22,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36e3324da/a3a8a713b02f4266a49b947d1d78f030/FLAG2ca20a921 [2025-01-10 01:16:23,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36e3324da/a3a8a713b02f4266a49b947d1d78f030 [2025-01-10 01:16:23,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:16:23,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:16:23,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:23,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:16:23,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:16:23,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bb8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23, skipping insertion in model container [2025-01-10 01:16:23,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:16:23,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:23,347 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:16:23,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:23,414 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:16:23,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23 WrapperNode [2025-01-10 01:16:23,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:23,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:23,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:16:23,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:16:23,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,454 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2025-01-10 01:16:23,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:23,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:16:23,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:16:23,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:16:23,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,467 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-01-10 01:16:23,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:16:23,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:16:23,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:16:23,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:16:23,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (1/1) ... [2025-01-10 01:16:23,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:23,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:23,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:16:23,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:16:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:16:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 01:16:23,520 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 01:16:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 01:16:23,520 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 01:16:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:16:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:16:23,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:16:23,521 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:16:23,609 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:16:23,610 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:16:23,750 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:16:23,750 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:16:23,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:16:23,835 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:16:23,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:23 BoogieIcfgContainer [2025-01-10 01:16:23,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:16:23,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:16:23,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:16:23,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:16:23,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:16:23" (1/3) ... [2025-01-10 01:16:23,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efee3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:23, skipping insertion in model container [2025-01-10 01:16:23,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:23" (2/3) ... [2025-01-10 01:16:23,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efee3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:23, skipping insertion in model container [2025-01-10 01:16:23,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:23" (3/3) ... [2025-01-10 01:16:23,849 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2025-01-10 01:16:23,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:16:23,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-64.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:16:23,861 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:16:23,900 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:23,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:23,951 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-01-10 01:16:23,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 6/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-01-10 01:16:23,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:23,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 57 flow [2025-01-10 01:16:23,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:23,976 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;@7f44f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:23,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:16:23,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:23,981 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-10 01:16:23,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:23,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:23,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:16:23,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:23,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2115065359, now seen corresponding path program 1 times [2025-01-10 01:16:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:23,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955409082] [2025-01-10 01:16:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:16:24,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:16:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955409082] [2025-01-10 01:16:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955409082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40370025] [2025-01-10 01:16:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:24,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:24,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:24,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-01-10 01:16:24,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:24,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-01-10 01:16:24,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:24,323 INFO L124 PetriNetUnfolderBase]: 31/91 cut-off events. [2025-01-10 01:16:24,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:24,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 91 events. 31/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 348 event pairs, 13 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 150. Up to 53 conditions per place. [2025-01-10 01:16:24,330 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 14 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2025-01-10 01:16:24,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 89 flow [2025-01-10 01:16:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-01-10 01:16:24,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2025-01-10 01:16:24,348 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 57 flow. Second operand 3 states and 49 transitions. [2025-01-10 01:16:24,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 89 flow [2025-01-10 01:16:24,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:24,356 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 58 flow [2025-01-10 01:16:24,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2025-01-10 01:16:24,361 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-01-10 01:16:24,363 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 58 flow [2025-01-10 01:16:24,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:24,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:24,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:16:24,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:24,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1613610286, now seen corresponding path program 1 times [2025-01-10 01:16:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:24,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164526488] [2025-01-10 01:16:24,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:16:24,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:16:24,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:24,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:24,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:16:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:16:24,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:24,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:24,406 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:24,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 01:16:24,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 01:16:24,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 01:16:24,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-10 01:16:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:16:24,409 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 01:16:24,410 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:24,410 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 01:16:24,436 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:24,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 90 flow [2025-01-10 01:16:24,457 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2025-01-10 01:16:24,459 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:16:24,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 64 events. 9/64 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 53. Up to 6 conditions per place. [2025-01-10 01:16:24,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 90 flow [2025-01-10 01:16:24,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2025-01-10 01:16:24,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:24,462 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;@7f44f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:24,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:16:24,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:24,465 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-10 01:16:24,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:24,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:24,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:16:24,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:24,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1144480977, now seen corresponding path program 1 times [2025-01-10 01:16:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:24,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253642322] [2025-01-10 01:16:24,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:16:24,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:16:24,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:24,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:24,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253642322] [2025-01-10 01:16:24,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253642322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:24,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281059389] [2025-01-10 01:16:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:24,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:24,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:24,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:24,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-10 01:16:24,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:24,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-10 01:16:24,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:24,682 INFO L124 PetriNetUnfolderBase]: 283/571 cut-off events. [2025-01-10 01:16:24,683 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 01:16:24,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 571 events. 283/571 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3199 event pairs, 111 based on Foata normal form. 40/533 useless extension candidates. Maximal degree in co-relation 444. Up to 433 conditions per place. [2025-01-10 01:16:24,691 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-01-10 01:16:24,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 132 flow [2025-01-10 01:16:24,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-10 01:16:24,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-01-10 01:16:24,693 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 3 states and 67 transitions. [2025-01-10 01:16:24,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 132 flow [2025-01-10 01:16:24,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:24,694 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 89 flow [2025-01-10 01:16:24,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-01-10 01:16:24,695 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-01-10 01:16:24,696 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 89 flow [2025-01-10 01:16:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:24,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:24,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:16:24,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:24,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash 885153725, now seen corresponding path program 1 times [2025-01-10 01:16:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186383267] [2025-01-10 01:16:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:16:24,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:16:24,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186383267] [2025-01-10 01:16:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186383267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:24,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:24,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722880508] [2025-01-10 01:16:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:24,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:24,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-10 01:16:24,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:24,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-10 01:16:24,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:24,915 INFO L124 PetriNetUnfolderBase]: 319/627 cut-off events. [2025-01-10 01:16:24,915 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 01:16:24,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 627 events. 319/627 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3596 event pairs, 263 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 512. Up to 445 conditions per place. [2025-01-10 01:16:24,923 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 20 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-01-10 01:16:24,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 145 flow [2025-01-10 01:16:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-01-10 01:16:24,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2025-01-10 01:16:24,924 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 89 flow. Second operand 4 states and 79 transitions. [2025-01-10 01:16:24,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 145 flow [2025-01-10 01:16:24,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:24,925 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 101 flow [2025-01-10 01:16:24,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-01-10 01:16:24,928 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-01-10 01:16:24,928 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 101 flow [2025-01-10 01:16:24,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:24,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:24,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:16:24,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:24,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1669142309, now seen corresponding path program 1 times [2025-01-10 01:16:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256753850] [2025-01-10 01:16:24,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:24,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:24,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:24,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256753850] [2025-01-10 01:16:24,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256753850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:24,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319252785] [2025-01-10 01:16:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:24,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:24,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:24,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:24,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 01:16:24,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:24,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 01:16:24,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:25,042 INFO L124 PetriNetUnfolderBase]: 319/607 cut-off events. [2025-01-10 01:16:25,042 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 01:16:25,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 607 events. 319/607 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3411 event pairs, 299 based on Foata normal form. 20/567 useless extension candidates. Maximal degree in co-relation 550. Up to 501 conditions per place. [2025-01-10 01:16:25,045 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-01-10 01:16:25,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 137 flow [2025-01-10 01:16:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-01-10 01:16:25,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-10 01:16:25,048 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 101 flow. Second operand 3 states and 57 transitions. [2025-01-10 01:16:25,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 137 flow [2025-01-10 01:16:25,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 131 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:25,051 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 93 flow [2025-01-10 01:16:25,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-01-10 01:16:25,052 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2025-01-10 01:16:25,052 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 93 flow [2025-01-10 01:16:25,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:25,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:16:25,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1669143008, now seen corresponding path program 1 times [2025-01-10 01:16:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385597655] [2025-01-10 01:16:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:25,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385597655] [2025-01-10 01:16:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385597655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:25,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:25,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709700714] [2025-01-10 01:16:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:25,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:25,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:25,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:25,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-10 01:16:25,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:25,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-10 01:16:25,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:25,214 INFO L124 PetriNetUnfolderBase]: 263/503 cut-off events. [2025-01-10 01:16:25,214 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 01:16:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 503 events. 263/503 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2643 event pairs, 33 based on Foata normal form. 4/479 useless extension candidates. Maximal degree in co-relation 1036. Up to 305 conditions per place. [2025-01-10 01:16:25,218 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 24 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-01-10 01:16:25,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 165 flow [2025-01-10 01:16:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-01-10 01:16:25,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2025-01-10 01:16:25,224 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 93 flow. Second operand 4 states and 83 transitions. [2025-01-10 01:16:25,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 165 flow [2025-01-10 01:16:25,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:25,225 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 102 flow [2025-01-10 01:16:25,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2025-01-10 01:16:25,226 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-01-10 01:16:25,226 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 102 flow [2025-01-10 01:16:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,226 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:25,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:16:25,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2052926647, now seen corresponding path program 1 times [2025-01-10 01:16:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517896943] [2025-01-10 01:16:25,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:25,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:25,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:25,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:25,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:25,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:25,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:25,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:25,260 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:25,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 01:16:25,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 01:16:25,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 01:16:25,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-10 01:16:25,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:16:25,260 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 01:16:25,261 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:25,261 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 01:16:25,280 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:25,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 122 flow [2025-01-10 01:16:25,289 INFO L124 PetriNetUnfolderBase]: 12/88 cut-off events. [2025-01-10 01:16:25,289 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:16:25,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 88 events. 12/88 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 85. Up to 8 conditions per place. [2025-01-10 01:16:25,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 43 transitions, 122 flow [2025-01-10 01:16:25,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 41 transitions, 115 flow [2025-01-10 01:16:25,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:25,292 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;@7f44f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:25,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:16:25,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:25,294 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-10 01:16:25,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:25,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:16:25,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:25,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 127607631, now seen corresponding path program 1 times [2025-01-10 01:16:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742329183] [2025-01-10 01:16:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:16:25,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:16:25,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:25,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742329183] [2025-01-10 01:16:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742329183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471138320] [2025-01-10 01:16:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:25,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:25,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:25,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:25,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 01:16:25,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:25,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 01:16:25,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:25,621 INFO L124 PetriNetUnfolderBase]: 1803/3003 cut-off events. [2025-01-10 01:16:25,621 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-10 01:16:25,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5722 conditions, 3003 events. 1803/3003 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18797 event pairs, 1385 based on Foata normal form. 168/2842 useless extension candidates. Maximal degree in co-relation 2516. Up to 2465 conditions per place. [2025-01-10 01:16:25,643 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-01-10 01:16:25,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 171 flow [2025-01-10 01:16:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-01-10 01:16:25,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-01-10 01:16:25,645 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 115 flow. Second operand 3 states and 83 transitions. [2025-01-10 01:16:25,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 171 flow [2025-01-10 01:16:25,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 166 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:25,649 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 116 flow [2025-01-10 01:16:25,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-01-10 01:16:25,650 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-01-10 01:16:25,650 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 116 flow [2025-01-10 01:16:25,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:25,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:16:25,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:25,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1271379499, now seen corresponding path program 1 times [2025-01-10 01:16:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166282593] [2025-01-10 01:16:25,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:16:25,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:16:25,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:25,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:25,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166282593] [2025-01-10 01:16:25,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166282593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:25,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:25,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341267691] [2025-01-10 01:16:25,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:25,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:25,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:25,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:25,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:25,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 01:16:25,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-01-10 01:16:25,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:25,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 01:16:25,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:25,946 INFO L124 PetriNetUnfolderBase]: 2031/3315 cut-off events. [2025-01-10 01:16:25,947 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-01-10 01:16:25,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6472 conditions, 3315 events. 2031/3315 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21004 event pairs, 1719 based on Foata normal form. 0/3106 useless extension candidates. Maximal degree in co-relation 2848. Up to 2477 conditions per place. [2025-01-10 01:16:25,972 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 26 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-01-10 01:16:25,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 188 flow [2025-01-10 01:16:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-01-10 01:16:25,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5872093023255814 [2025-01-10 01:16:25,973 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 116 flow. Second operand 4 states and 101 transitions. [2025-01-10 01:16:25,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 188 flow [2025-01-10 01:16:25,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:25,975 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 128 flow [2025-01-10 01:16:25,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-01-10 01:16:25,976 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-01-10 01:16:25,976 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 128 flow [2025-01-10 01:16:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-01-10 01:16:25,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:25,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:16:25,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash -758878152, now seen corresponding path program 1 times [2025-01-10 01:16:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239566055] [2025-01-10 01:16:25,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:25,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:26,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:26,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239566055] [2025-01-10 01:16:26,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239566055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:26,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:26,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052939000] [2025-01-10 01:16:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:26,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:26,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:26,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:26,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 01:16:26,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-01-10 01:16:26,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:26,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 01:16:26,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:26,249 INFO L124 PetriNetUnfolderBase]: 2031/3231 cut-off events. [2025-01-10 01:16:26,249 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-01-10 01:16:26,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 3231 events. 2031/3231 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19858 event pairs, 1947 based on Foata normal form. 84/3064 useless extension candidates. Maximal degree in co-relation 3014. Up to 2789 conditions per place. [2025-01-10 01:16:26,268 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 21 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-01-10 01:16:26,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 172 flow [2025-01-10 01:16:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 01:16:26,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2025-01-10 01:16:26,269 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 128 flow. Second operand 3 states and 73 transitions. [2025-01-10 01:16:26,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 172 flow [2025-01-10 01:16:26,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 39 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:26,277 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 120 flow [2025-01-10 01:16:26,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-01-10 01:16:26,277 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-01-10 01:16:26,277 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 120 flow [2025-01-10 01:16:26,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-01-10 01:16:26,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:16:26,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:26,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash -758877453, now seen corresponding path program 1 times [2025-01-10 01:16:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140804780] [2025-01-10 01:16:26,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:26,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:26,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140804780] [2025-01-10 01:16:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140804780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:26,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479013181] [2025-01-10 01:16:26,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:26,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:26,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:26,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 01:16:26,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-01-10 01:16:26,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:26,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 01:16:26,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:26,605 INFO L124 PetriNetUnfolderBase]: 1783/2871 cut-off events. [2025-01-10 01:16:26,606 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2025-01-10 01:16:26,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5914 conditions, 2871 events. 1783/2871 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17132 event pairs, 761 based on Foata normal form. 4/2660 useless extension candidates. Maximal degree in co-relation 5900. Up to 2337 conditions per place. [2025-01-10 01:16:26,620 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 30 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-01-10 01:16:26,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 49 transitions, 210 flow [2025-01-10 01:16:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-01-10 01:16:26,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-01-10 01:16:26,622 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 120 flow. Second operand 4 states and 105 transitions. [2025-01-10 01:16:26,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 49 transitions, 210 flow [2025-01-10 01:16:26,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:26,626 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 135 flow [2025-01-10 01:16:26,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2025-01-10 01:16:26,627 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-01-10 01:16:26,627 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 135 flow [2025-01-10 01:16:26,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-01-10 01:16:26,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,627 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:16:26,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:26,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 253410039, now seen corresponding path program 1 times [2025-01-10 01:16:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111369744] [2025-01-10 01:16:26,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:26,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:26,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111369744] [2025-01-10 01:16:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111369744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:26,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539710590] [2025-01-10 01:16:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:26,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:26,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:26,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-01-10 01:16:26,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:26,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:26,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-01-10 01:16:26,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:26,903 INFO L124 PetriNetUnfolderBase]: 1639/2615 cut-off events. [2025-01-10 01:16:26,903 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-01-10 01:16:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5552 conditions, 2615 events. 1639/2615 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14917 event pairs, 241 based on Foata normal form. 16/2456 useless extension candidates. Maximal degree in co-relation 5536. Up to 1601 conditions per place. [2025-01-10 01:16:26,919 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 36 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-01-10 01:16:26,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 249 flow [2025-01-10 01:16:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-10 01:16:26,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2025-01-10 01:16:26,920 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 135 flow. Second operand 5 states and 130 transitions. [2025-01-10 01:16:26,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 249 flow [2025-01-10 01:16:26,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 243 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:26,922 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 141 flow [2025-01-10 01:16:26,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-01-10 01:16:26,924 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-01-10 01:16:26,924 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 141 flow [2025-01-10 01:16:26,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:26,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,924 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:16:26,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:26,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1315520002, now seen corresponding path program 1 times [2025-01-10 01:16:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791354440] [2025-01-10 01:16:26,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:16:26,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:16:26,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:26,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:26,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:16:26,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:16:26,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:26,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:26,954 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:26,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 01:16:26,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 01:16:26,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 01:16:26,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-10 01:16:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:16:26,955 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,955 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:26,956 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 01:16:26,982 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:26,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 51 transitions, 158 flow [2025-01-10 01:16:26,988 INFO L124 PetriNetUnfolderBase]: 15/112 cut-off events. [2025-01-10 01:16:26,988 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 01:16:26,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 112 events. 15/112 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 119. Up to 10 conditions per place. [2025-01-10 01:16:26,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 51 transitions, 158 flow [2025-01-10 01:16:26,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 49 transitions, 150 flow [2025-01-10 01:16:26,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:26,990 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;@7f44f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:26,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:16:26,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:26,991 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-10 01:16:26,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:26,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:26,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1636363887, now seen corresponding path program 1 times [2025-01-10 01:16:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75256460] [2025-01-10 01:16:26,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:16:26,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:16:26,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:27,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75256460] [2025-01-10 01:16:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75256460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:27,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672391374] [2025-01-10 01:16:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:27,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:27,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:27,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:27,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 01:16:27,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:27,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:27,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 01:16:27,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:27,998 INFO L124 PetriNetUnfolderBase]: 9931/14779 cut-off events. [2025-01-10 01:16:27,998 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2025-01-10 01:16:28,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28636 conditions, 14779 events. 9931/14779 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 98186 event pairs, 8233 based on Foata normal form. 680/14105 useless extension candidates. Maximal degree in co-relation 12948. Up to 12641 conditions per place. [2025-01-10 01:16:28,087 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-01-10 01:16:28,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 214 flow [2025-01-10 01:16:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-10 01:16:28,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-01-10 01:16:28,089 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 150 flow. Second operand 3 states and 99 transitions. [2025-01-10 01:16:28,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 214 flow [2025-01-10 01:16:28,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 51 transitions, 201 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:28,098 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 143 flow [2025-01-10 01:16:28,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-01-10 01:16:28,099 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-01-10 01:16:28,099 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 143 flow [2025-01-10 01:16:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:28,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:28,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:28,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:16:28,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:28,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash 328814325, now seen corresponding path program 1 times [2025-01-10 01:16:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073751715] [2025-01-10 01:16:28,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:28,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:16:28,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:16:28,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:28,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:28,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073751715] [2025-01-10 01:16:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073751715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:28,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:28,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751812400] [2025-01-10 01:16:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:28,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:28,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:28,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 01:16:28,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-01-10 01:16:28,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:28,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 01:16:28,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:29,173 INFO L124 PetriNetUnfolderBase]: 11183/16371 cut-off events. [2025-01-10 01:16:29,174 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2025-01-10 01:16:29,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32074 conditions, 16371 events. 11183/16371 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 108080 event pairs, 9591 based on Foata normal form. 0/15521 useless extension candidates. Maximal degree in co-relation 14496. Up to 12653 conditions per place. [2025-01-10 01:16:29,377 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 32 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-01-10 01:16:29,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 231 flow [2025-01-10 01:16:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-01-10 01:16:29,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2025-01-10 01:16:29,379 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 143 flow. Second operand 4 states and 123 transitions. [2025-01-10 01:16:29,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 231 flow [2025-01-10 01:16:29,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:29,382 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 155 flow [2025-01-10 01:16:29,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2025-01-10 01:16:29,383 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 4 predicate places. [2025-01-10 01:16:29,383 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 155 flow [2025-01-10 01:16:29,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-01-10 01:16:29,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:29,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:29,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:16:29,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:29,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1602490187, now seen corresponding path program 1 times [2025-01-10 01:16:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:29,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663818792] [2025-01-10 01:16:29,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:29,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:29,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:29,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663818792] [2025-01-10 01:16:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663818792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913605358] [2025-01-10 01:16:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:29,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:29,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:29,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2025-01-10 01:16:29,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 155 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-01-10 01:16:29,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:29,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2025-01-10 01:16:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:30,532 INFO L124 PetriNetUnfolderBase]: 11183/16031 cut-off events. [2025-01-10 01:16:30,533 INFO L125 PetriNetUnfolderBase]: For 2170/2170 co-relation queries the response was YES. [2025-01-10 01:16:30,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33432 conditions, 16031 events. 11183/16031 cut-off events. For 2170/2170 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 102441 event pairs, 10843 based on Foata normal form. 340/15351 useless extension candidates. Maximal degree in co-relation 15174. Up to 14245 conditions per place. [2025-01-10 01:16:30,614 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 25 selfloop transitions, 1 changer transitions 1/47 dead transitions. [2025-01-10 01:16:30,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 47 transitions, 207 flow [2025-01-10 01:16:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 01:16:30,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5816993464052288 [2025-01-10 01:16:30,616 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 155 flow. Second operand 3 states and 89 transitions. [2025-01-10 01:16:30,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 47 transitions, 207 flow [2025-01-10 01:16:30,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 47 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:30,646 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 147 flow [2025-01-10 01:16:30,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-01-10 01:16:30,647 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2025-01-10 01:16:30,647 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 147 flow [2025-01-10 01:16:30,647 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-01-10 01:16:30,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:30,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:16:30,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:30,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1602490886, now seen corresponding path program 1 times [2025-01-10 01:16:30,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:30,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661696425] [2025-01-10 01:16:30,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:30,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:30,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:30,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:30,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661696425] [2025-01-10 01:16:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661696425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936240650] [2025-01-10 01:16:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:30,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:30,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:30,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:30,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 01:16:30,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-01-10 01:16:30,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:30,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 01:16:30,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:31,594 INFO L124 PetriNetUnfolderBase]: 9911/14391 cut-off events. [2025-01-10 01:16:31,594 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2025-01-10 01:16:31,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29468 conditions, 14391 events. 9911/14391 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 91650 event pairs, 4223 based on Foata normal form. 4/13407 useless extension candidates. Maximal degree in co-relation 29452. Up to 12513 conditions per place. [2025-01-10 01:16:31,729 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 34 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2025-01-10 01:16:31,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 245 flow [2025-01-10 01:16:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-01-10 01:16:31,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2025-01-10 01:16:31,734 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 147 flow. Second operand 4 states and 125 transitions. [2025-01-10 01:16:31,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 245 flow [2025-01-10 01:16:31,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 57 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:31,771 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 162 flow [2025-01-10 01:16:31,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2025-01-10 01:16:31,771 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2025-01-10 01:16:31,771 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 162 flow [2025-01-10 01:16:31,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-01-10 01:16:31,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:31,772 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:31,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:16:31,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:31,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1468394486, now seen corresponding path program 1 times [2025-01-10 01:16:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670590448] [2025-01-10 01:16:31,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:31,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:31,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:31,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670590448] [2025-01-10 01:16:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670590448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:31,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:31,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930825342] [2025-01-10 01:16:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:31,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:31,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:31,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:31,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 01:16:31,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-01-10 01:16:31,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:31,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 01:16:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:32,728 INFO L124 PetriNetUnfolderBase]: 9767/14135 cut-off events. [2025-01-10 01:16:32,729 INFO L125 PetriNetUnfolderBase]: For 2398/2398 co-relation queries the response was YES. [2025-01-10 01:16:32,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29618 conditions, 14135 events. 9767/14135 cut-off events. For 2398/2398 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 88931 event pairs, 1863 based on Foata normal form. 16/13283 useless extension candidates. Maximal degree in co-relation 29600. Up to 11777 conditions per place. [2025-01-10 01:16:32,810 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 42 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-01-10 01:16:32,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 296 flow [2025-01-10 01:16:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-01-10 01:16:32,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2025-01-10 01:16:32,811 INFO L175 Difference]: Start difference. First operand has 69 places, 47 transitions, 162 flow. Second operand 5 states and 156 transitions. [2025-01-10 01:16:32,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 296 flow [2025-01-10 01:16:32,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 290 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:32,828 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 176 flow [2025-01-10 01:16:32,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2025-01-10 01:16:32,829 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2025-01-10 01:16:32,829 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 176 flow [2025-01-10 01:16:32,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-01-10 01:16:32,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:32,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:16:32,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:32,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1442009732, now seen corresponding path program 1 times [2025-01-10 01:16:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:32,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865699719] [2025-01-10 01:16:32,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:32,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:16:32,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:16:32,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:32,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865699719] [2025-01-10 01:16:32,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865699719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:32,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:32,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:16:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412948979] [2025-01-10 01:16:32,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:32,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:16:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:32,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:16:32,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:16:32,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 01:16:32,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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-01-10 01:16:32,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:32,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 01:16:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:33,648 INFO L124 PetriNetUnfolderBase]: 8935/12855 cut-off events. [2025-01-10 01:16:33,649 INFO L125 PetriNetUnfolderBase]: For 3190/3190 co-relation queries the response was YES. [2025-01-10 01:16:33,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27559 conditions, 12855 events. 8935/12855 cut-off events. For 3190/3190 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 78927 event pairs, 345 based on Foata normal form. 64/12501 useless extension candidates. Maximal degree in co-relation 27540. Up to 7937 conditions per place. [2025-01-10 01:16:33,707 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 50 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-01-10 01:16:33,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 340 flow [2025-01-10 01:16:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:16:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:16:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2025-01-10 01:16:33,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 01:16:33,708 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 176 flow. Second operand 6 states and 187 transitions. [2025-01-10 01:16:33,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 340 flow [2025-01-10 01:16:33,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 330 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:16:33,722 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 180 flow [2025-01-10 01:16:33,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2025-01-10 01:16:33,723 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2025-01-10 01:16:33,723 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 180 flow [2025-01-10 01:16:33,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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-01-10 01:16:33,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:33,723 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:33,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:16:33,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:33,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash -291952737, now seen corresponding path program 1 times [2025-01-10 01:16:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51189945] [2025-01-10 01:16:33,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:33,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:16:33,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:16:33,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:33,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:33,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:33,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:16:33,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:16:33,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:33,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:33,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:33,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:33,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 01:16:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 01:16:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 01:16:33,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-10 01:16:33,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:16:33,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:33,742 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:33,742 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 01:16:33,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:33,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 59 transitions, 198 flow [2025-01-10 01:16:33,766 INFO L124 PetriNetUnfolderBase]: 18/136 cut-off events. [2025-01-10 01:16:33,766 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 01:16:33,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 136 events. 18/136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-01-10 01:16:33,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 59 transitions, 198 flow [2025-01-10 01:16:33,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 57 transitions, 189 flow [2025-01-10 01:16:33,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:33,768 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;@7f44f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:33,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:16:33,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:33,769 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-10 01:16:33,769 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:33,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:33,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:16:33,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -913179505, now seen corresponding path program 1 times [2025-01-10 01:16:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890547625] [2025-01-10 01:16:33,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:33,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:16:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:16:33,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:33,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:33,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890547625] [2025-01-10 01:16:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890547625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:33,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992007673] [2025-01-10 01:16:33,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:33,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:33,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:33,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-01-10 01:16:33,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 01:16:33,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:33,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-01-10 01:16:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:38,087 INFO L124 PetriNetUnfolderBase]: 50635/70075 cut-off events. [2025-01-10 01:16:38,088 INFO L125 PetriNetUnfolderBase]: For 19228/19228 co-relation queries the response was YES. [2025-01-10 01:16:38,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137438 conditions, 70075 events. 50635/70075 cut-off events. For 19228/19228 co-relation queries the response was YES. Maximal size of possible extension queue 2615. Compared 480313 event pairs, 38367 based on Foata normal form. 2728/67358 useless extension candidates. Maximal degree in co-relation 63252. Up to 61537 conditions per place. [2025-01-10 01:16:38,851 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-01-10 01:16:38,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 59 transitions, 261 flow [2025-01-10 01:16:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-01-10 01:16:38,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6497175141242938 [2025-01-10 01:16:38,853 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 189 flow. Second operand 3 states and 115 transitions. [2025-01-10 01:16:38,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 59 transitions, 261 flow [2025-01-10 01:16:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 59 transitions, 236 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:38,934 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 170 flow [2025-01-10 01:16:38,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2025-01-10 01:16:38,935 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2025-01-10 01:16:38,935 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 170 flow [2025-01-10 01:16:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-01-10 01:16:38,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:38,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:38,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:16:38,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:38,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1390767901, now seen corresponding path program 1 times [2025-01-10 01:16:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792013404] [2025-01-10 01:16:38,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:38,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:16:38,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:16:38,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792013404] [2025-01-10 01:16:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792013404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089062170] [2025-01-10 01:16:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:38,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:38,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-01-10 01:16:38,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-01-10 01:16:38,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:38,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-01-10 01:16:38,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:43,808 INFO L124 PetriNetUnfolderBase]: 57007/77811 cut-off events. [2025-01-10 01:16:43,809 INFO L125 PetriNetUnfolderBase]: For 11430/11430 co-relation queries the response was YES. [2025-01-10 01:16:44,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152908 conditions, 77811 events. 57007/77811 cut-off events. For 11430/11430 co-relation queries the response was YES. Maximal size of possible extension queue 2864. Compared 526258 event pairs, 38411 based on Foata normal form. 0/74402 useless extension candidates. Maximal degree in co-relation 70304. Up to 61549 conditions per place. [2025-01-10 01:16:44,381 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 38 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-01-10 01:16:44,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 274 flow [2025-01-10 01:16:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-01-10 01:16:44,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2025-01-10 01:16:44,382 INFO L175 Difference]: Start difference. First operand has 77 places, 55 transitions, 170 flow. Second operand 4 states and 145 transitions. [2025-01-10 01:16:44,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 274 flow [2025-01-10 01:16:44,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 66 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:44,400 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 182 flow [2025-01-10 01:16:44,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=80, PETRI_TRANSITIONS=56} [2025-01-10 01:16:44,400 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 4 predicate places. [2025-01-10 01:16:44,400 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 182 flow [2025-01-10 01:16:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-01-10 01:16:44,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:44,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:44,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:16:44,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:44,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash 163312734, now seen corresponding path program 1 times [2025-01-10 01:16:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141267409] [2025-01-10 01:16:44,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:44,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:44,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:44,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141267409] [2025-01-10 01:16:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141267409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390104239] [2025-01-10 01:16:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:44,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-01-10 01:16:44,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-10 01:16:44,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:44,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-01-10 01:16:44,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:49,670 INFO L124 PetriNetUnfolderBase]: 57007/76447 cut-off events. [2025-01-10 01:16:49,670 INFO L125 PetriNetUnfolderBase]: For 12794/12794 co-relation queries the response was YES. [2025-01-10 01:16:50,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158362 conditions, 76447 events. 57007/76447 cut-off events. For 12794/12794 co-relation queries the response was YES. Maximal size of possible extension queue 2793. Compared 495929 event pairs, 55643 based on Foata normal form. 1364/73720 useless extension candidates. Maximal degree in co-relation 73030. Up to 69285 conditions per place. [2025-01-10 01:16:50,557 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 29 selfloop transitions, 1 changer transitions 1/55 dead transitions. [2025-01-10 01:16:50,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 55 transitions, 242 flow [2025-01-10 01:16:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 01:16:50,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2025-01-10 01:16:50,562 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 182 flow. Second operand 3 states and 105 transitions. [2025-01-10 01:16:50,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 55 transitions, 242 flow [2025-01-10 01:16:51,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 55 transitions, 236 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:51,168 INFO L231 Difference]: Finished difference. Result has 79 places, 54 transitions, 174 flow [2025-01-10 01:16:51,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=54} [2025-01-10 01:16:51,169 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-01-10 01:16:51,169 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 54 transitions, 174 flow [2025-01-10 01:16:51,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-10 01:16:51,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:51,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:16:51,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash 163313433, now seen corresponding path program 1 times [2025-01-10 01:16:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588756356] [2025-01-10 01:16:51,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:16:51,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:16:51,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:51,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588756356] [2025-01-10 01:16:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588756356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325575897] [2025-01-10 01:16:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:51,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:51,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:51,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:51,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-01-10 01:16:51,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 54 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-10 01:16:51,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:51,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-01-10 01:16:51,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:55,384 INFO L124 PetriNetUnfolderBase]: 50615/68663 cut-off events. [2025-01-10 01:16:55,384 INFO L125 PetriNetUnfolderBase]: For 11436/11436 co-relation queries the response was YES. [2025-01-10 01:16:55,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140062 conditions, 68663 events. 50615/68663 cut-off events. For 11436/11436 co-relation queries the response was YES. Maximal size of possible extension queue 2485. Compared 449438 event pairs, 27537 based on Foata normal form. 4/64596 useless extension candidates. Maximal degree in co-relation 140044. Up to 61409 conditions per place. [2025-01-10 01:16:55,926 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 38 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-01-10 01:16:55,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 65 transitions, 280 flow [2025-01-10 01:16:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-01-10 01:16:55,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2025-01-10 01:16:55,927 INFO L175 Difference]: Start difference. First operand has 79 places, 54 transitions, 174 flow. Second operand 4 states and 145 transitions. [2025-01-10 01:16:55,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 65 transitions, 280 flow [2025-01-10 01:16:56,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 65 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:56,227 INFO L231 Difference]: Finished difference. Result has 81 places, 55 transitions, 189 flow [2025-01-10 01:16:56,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=81, PETRI_TRANSITIONS=55} [2025-01-10 01:16:56,228 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 5 predicate places. [2025-01-10 01:16:56,228 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 55 transitions, 189 flow [2025-01-10 01:16:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-10 01:16:56,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:56,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:56,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:16:56,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:16:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1125213477, now seen corresponding path program 1 times [2025-01-10 01:16:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095728816] [2025-01-10 01:16:56,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:56,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:56,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:56,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:56,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095728816] [2025-01-10 01:16:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095728816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715486739] [2025-01-10 01:16:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:56,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:56,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:56,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-01-10 01:16:56,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 55 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-01-10 01:16:56,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:56,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-01-10 01:16:56,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand