./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:18:46,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:18:46,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:18:46,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:18:46,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:18:46,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:18:46,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:18:46,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:18:46,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:18:46,110 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:18:46,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:18:46,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:18:46,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:18:46,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:18:46,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:18:46,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:18:46,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:18:46,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:18:46,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:18:46,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:18:46,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:18:46,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:18:46,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:18:46,113 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-17 14:18:46,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:18:46,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:18:46,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:18:46,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:18:46,345 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:18:46,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-17 14:18:47,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13f93084/da99d9e81375475a8ab117eb7ee7d5bb/FLAGc594e239a [2025-03-17 14:18:47,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:18:47,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-17 14:18:47,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13f93084/da99d9e81375475a8ab117eb7ee7d5bb/FLAGc594e239a [2025-03-17 14:18:47,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13f93084/da99d9e81375475a8ab117eb7ee7d5bb [2025-03-17 14:18:47,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:18:47,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:18:47,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:18:47,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:18:47,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:18:47,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:18:47" (1/1) ... [2025-03-17 14:18:47,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f57c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:47, skipping insertion in model container [2025-03-17 14:18:47,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:18:47" (1/1) ... [2025-03-17 14:18:47,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:18:47,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:18:48,000 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:18:48,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:18:48,071 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:18:48,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48 WrapperNode [2025-03-17 14:18:48,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:18:48,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:18:48,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:18:48,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:18:48,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,108 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 116 [2025-03-17 14:18:48,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:18:48,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:18:48,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:18:48,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:18:48,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,135 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-03-17 14:18:48,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:18:48,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:18:48,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:18:48,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:18:48,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (1/1) ... [2025-03-17 14:18:48,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:18:48,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:18:48,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:18:48,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-17 14:18:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:18:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:18:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:18:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:18:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:18:48,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:18:48,211 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:18:48,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:18:48,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:18:48,541 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:18:48,541 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:18:48,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:18:48,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:18:48,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:18:48 BoogieIcfgContainer [2025-03-17 14:18:48,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:18:48,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:18:48,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:18:48,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:18:48,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:18:47" (1/3) ... [2025-03-17 14:18:48,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50de5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:18:48, skipping insertion in model container [2025-03-17 14:18:48,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:48" (2/3) ... [2025-03-17 14:18:48,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50de5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:18:48, skipping insertion in model container [2025-03-17 14:18:48,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:18:48" (3/3) ... [2025-03-17 14:18:48,635 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-17 14:18:48,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:18:48,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 66 locations, 1 initial locations, 3 loop locations, and 23 error locations. [2025-03-17 14:18:48,647 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:18:48,689 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:18:48,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 154 flow [2025-03-17 14:18:48,753 INFO L124 PetriNetUnfolderBase]: 10/74 cut-off events. [2025-03-17 14:18:48,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:18:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 10/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 209 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-17 14:18:48,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 75 transitions, 154 flow [2025-03-17 14:18:48,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 74 transitions, 151 flow [2025-03-17 14:18:48,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:18:48,785 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;@52a5e065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:18:48,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 14:18:48,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:18:48,789 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-17 14:18:48,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:18:48,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:48,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:18:48,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:48,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash 11841, now seen corresponding path program 1 times [2025-03-17 14:18:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518750633] [2025-03-17 14:18:48,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:48,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:48,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:18:48,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:18:48,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:48,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518750633] [2025-03-17 14:18:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518750633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:48,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:48,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:18:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192730160] [2025-03-17 14:18:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:18:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:49,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:18:49,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:18:49,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-03-17 14:18:49,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:49,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:49,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-03-17 14:18:49,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:49,174 INFO L124 PetriNetUnfolderBase]: 198/607 cut-off events. [2025-03-17 14:18:49,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:18:49,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 607 events. 198/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3794 event pairs, 143 based on Foata normal form. 52/507 useless extension candidates. Maximal degree in co-relation 956. Up to 356 conditions per place. [2025-03-17 14:18:49,179 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-17 14:18:49,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 193 flow [2025-03-17 14:18:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:18:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:18:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-03-17 14:18:49,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-17 14:18:49,189 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 151 flow. Second operand 3 states and 145 transitions. [2025-03-17 14:18:49,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 193 flow [2025-03-17 14:18:49,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:18:49,193 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 136 flow [2025-03-17 14:18:49,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-03-17 14:18:49,197 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2025-03-17 14:18:49,197 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 136 flow [2025-03-17 14:18:49,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:49,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:49,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:18:49,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:18:49,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 11842, now seen corresponding path program 1 times [2025-03-17 14:18:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810690010] [2025-03-17 14:18:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:49,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:18:49,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:18:49,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:49,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810690010] [2025-03-17 14:18:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810690010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:18:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781909637] [2025-03-17 14:18:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:18:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:49,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:18:49,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:18:49,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-03-17 14:18:49,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:49,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:49,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-03-17 14:18:49,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:49,441 INFO L124 PetriNetUnfolderBase]: 198/606 cut-off events. [2025-03-17 14:18:49,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:18:49,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 606 events. 198/606 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3785 event pairs, 143 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 960. Up to 356 conditions per place. [2025-03-17 14:18:49,448 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-17 14:18:49,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 194 flow [2025-03-17 14:18:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:18:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:18:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-17 14:18:49,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-03-17 14:18:49,450 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 136 flow. Second operand 3 states and 139 transitions. [2025-03-17 14:18:49,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 194 flow [2025-03-17 14:18:49,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:49,452 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 134 flow [2025-03-17 14:18:49,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2025-03-17 14:18:49,452 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-03-17 14:18:49,453 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 134 flow [2025-03-17 14:18:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:49,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:49,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:18:49,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:18:49,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1935351865, now seen corresponding path program 1 times [2025-03-17 14:18:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861876256] [2025-03-17 14:18:49,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:49,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:18:49,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:18:49,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:49,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861876256] [2025-03-17 14:18:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861876256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:49,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:49,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:18:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910616013] [2025-03-17 14:18:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:18:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:49,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:18:49,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:18:49,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-03-17 14:18:49,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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-03-17 14:18:49,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:49,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-03-17 14:18:49,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:49,603 INFO L124 PetriNetUnfolderBase]: 198/604 cut-off events. [2025-03-17 14:18:49,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:18:49,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 604 events. 198/604 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3791 event pairs, 143 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 958. Up to 356 conditions per place. [2025-03-17 14:18:49,608 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 29 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-03-17 14:18:49,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 192 flow [2025-03-17 14:18:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:18:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:18:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-17 14:18:49,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-03-17 14:18:49,610 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 134 flow. Second operand 3 states and 139 transitions. [2025-03-17 14:18:49,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 192 flow [2025-03-17 14:18:49,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:49,611 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 130 flow [2025-03-17 14:18:49,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-17 14:18:49,612 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-03-17 14:18:49,612 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 130 flow [2025-03-17 14:18:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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-03-17 14:18:49,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:49,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:49,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:18:49,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:49,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -152337627, now seen corresponding path program 1 times [2025-03-17 14:18:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507101743] [2025-03-17 14:18:49,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:18:49,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:18:49,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:49,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:49,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:49,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507101743] [2025-03-17 14:18:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507101743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:49,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:18:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840127582] [2025-03-17 14:18:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:18:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:49,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:18:49,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:18:49,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:49,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:49,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:49,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:49,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:49,875 INFO L124 PetriNetUnfolderBase]: 213/582 cut-off events. [2025-03-17 14:18:49,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:18:49,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 582 events. 213/582 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3436 event pairs, 52 based on Foata normal form. 36/477 useless extension candidates. Maximal degree in co-relation 951. Up to 227 conditions per place. [2025-03-17 14:18:49,877 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 44 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-17 14:18:49,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 252 flow [2025-03-17 14:18:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:18:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:18:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-17 14:18:49,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-03-17 14:18:49,879 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 130 flow. Second operand 4 states and 186 transitions. [2025-03-17 14:18:49,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 252 flow [2025-03-17 14:18:49,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:18:49,880 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 129 flow [2025-03-17 14:18:49,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-03-17 14:18:49,881 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-03-17 14:18:49,881 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 129 flow [2025-03-17 14:18:49,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:49,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:49,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:18:49,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -152337626, now seen corresponding path program 1 times [2025-03-17 14:18:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783806005] [2025-03-17 14:18:49,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:49,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:18:49,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:18:49,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:49,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:49,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:49,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783806005] [2025-03-17 14:18:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783806005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:49,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:18:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460333834] [2025-03-17 14:18:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:49,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:18:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:49,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:18:49,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:18:50,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:50,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:50,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:50,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:50,105 INFO L124 PetriNetUnfolderBase]: 213/531 cut-off events. [2025-03-17 14:18:50,105 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:18:50,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 531 events. 213/531 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2934 event pairs, 52 based on Foata normal form. 36/477 useless extension candidates. Maximal degree in co-relation 935. Up to 227 conditions per place. [2025-03-17 14:18:50,107 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 44 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-17 14:18:50,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 251 flow [2025-03-17 14:18:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:18:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:18:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-17 14:18:50,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-03-17 14:18:50,112 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 129 flow. Second operand 4 states and 186 transitions. [2025-03-17 14:18:50,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 251 flow [2025-03-17 14:18:50,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:18:50,115 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 123 flow [2025-03-17 14:18:50,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-17 14:18:50,116 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2025-03-17 14:18:50,116 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 123 flow [2025-03-17 14:18:50,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:50,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:18:50,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash -118914251, now seen corresponding path program 1 times [2025-03-17 14:18:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565899499] [2025-03-17 14:18:50,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:18:50,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:18:50,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:50,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565899499] [2025-03-17 14:18:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565899499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:18:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834931282] [2025-03-17 14:18:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:18:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:50,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:18:50,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:18:50,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-17 14:18:50,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:50,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-17 14:18:50,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:50,296 INFO L124 PetriNetUnfolderBase]: 206/520 cut-off events. [2025-03-17 14:18:50,296 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-17 14:18:50,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 520 events. 206/520 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2811 event pairs, 60 based on Foata normal form. 22/480 useless extension candidates. Maximal degree in co-relation 911. Up to 324 conditions per place. [2025-03-17 14:18:50,298 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 37 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-17 14:18:50,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 215 flow [2025-03-17 14:18:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:18:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:18:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2025-03-17 14:18:50,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-17 14:18:50,299 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 123 flow. Second operand 4 states and 170 transitions. [2025-03-17 14:18:50,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 215 flow [2025-03-17 14:18:50,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 205 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:18:50,300 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 111 flow [2025-03-17 14:18:50,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-17 14:18:50,301 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2025-03-17 14:18:50,301 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 111 flow [2025-03-17 14:18:50,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:50,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:18:50,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash -118914250, now seen corresponding path program 1 times [2025-03-17 14:18:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863140693] [2025-03-17 14:18:50,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:50,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:18:50,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:18:50,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:50,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863140693] [2025-03-17 14:18:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863140693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:18:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712451400] [2025-03-17 14:18:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:18:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:50,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:18:50,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:18:50,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-17 14:18:50,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:50,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-17 14:18:50,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:50,494 INFO L124 PetriNetUnfolderBase]: 192/468 cut-off events. [2025-03-17 14:18:50,494 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 14:18:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 468 events. 192/468 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2370 event pairs, 8 based on Foata normal form. 20/433 useless extension candidates. Maximal degree in co-relation 848. Up to 319 conditions per place. [2025-03-17 14:18:50,496 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 37 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-17 14:18:50,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 199 flow [2025-03-17 14:18:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:18:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:18:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2025-03-17 14:18:50,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-17 14:18:50,497 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 111 flow. Second operand 4 states and 170 transitions. [2025-03-17 14:18:50,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 199 flow [2025-03-17 14:18:50,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:18:50,507 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 99 flow [2025-03-17 14:18:50,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-17 14:18:50,507 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2025-03-17 14:18:50,507 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 99 flow [2025-03-17 14:18:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:50,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:50,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:18:50,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 685272706, now seen corresponding path program 1 times [2025-03-17 14:18:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404158429] [2025-03-17 14:18:50,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:50,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:18:50,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:18:50,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:50,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404158429] [2025-03-17 14:18:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404158429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:50,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089676354] [2025-03-17 14:18:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:18:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:50,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:18:50,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:18:50,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:50,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:50,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:50,948 INFO L124 PetriNetUnfolderBase]: 457/949 cut-off events. [2025-03-17 14:18:50,948 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 14:18:50,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 949 events. 457/949 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4959 event pairs, 60 based on Foata normal form. 0/788 useless extension candidates. Maximal degree in co-relation 1842. Up to 427 conditions per place. [2025-03-17 14:18:50,952 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 79 selfloop transitions, 16 changer transitions 0/107 dead transitions. [2025-03-17 14:18:50,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 417 flow [2025-03-17 14:18:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:18:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:18:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 335 transitions. [2025-03-17 14:18:50,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-03-17 14:18:50,955 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 99 flow. Second operand 7 states and 335 transitions. [2025-03-17 14:18:50,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 417 flow [2025-03-17 14:18:50,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 407 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:18:50,960 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 197 flow [2025-03-17 14:18:50,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2025-03-17 14:18:50,961 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2025-03-17 14:18:50,961 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 197 flow [2025-03-17 14:18:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:50,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:50,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:50,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:18:50,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 686104836, now seen corresponding path program 1 times [2025-03-17 14:18:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863849027] [2025-03-17 14:18:50,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:50,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:18:50,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:18:50,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:50,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:18:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863849027] [2025-03-17 14:18:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863849027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691781207] [2025-03-17 14:18:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:18:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:18:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:18:51,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-17 14:18:51,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:51,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:51,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-17 14:18:51,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:51,339 INFO L124 PetriNetUnfolderBase]: 574/1173 cut-off events. [2025-03-17 14:18:51,339 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-03-17 14:18:51,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 1173 events. 574/1173 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6420 event pairs, 119 based on Foata normal form. 29/1044 useless extension candidates. Maximal degree in co-relation 2691. Up to 580 conditions per place. [2025-03-17 14:18:51,346 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 85 selfloop transitions, 24 changer transitions 0/120 dead transitions. [2025-03-17 14:18:51,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 589 flow [2025-03-17 14:18:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:18:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:18:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2025-03-17 14:18:51,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-17 14:18:51,347 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 197 flow. Second operand 6 states and 290 transitions. [2025-03-17 14:18:51,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 589 flow [2025-03-17 14:18:51,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 587 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:18:51,355 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 387 flow [2025-03-17 14:18:51,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2025-03-17 14:18:51,355 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-03-17 14:18:51,355 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 387 flow [2025-03-17 14:18:51,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:51,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:51,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:51,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:18:51,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -790035087, now seen corresponding path program 1 times [2025-03-17 14:18:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:51,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429509502] [2025-03-17 14:18:51,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:51,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:18:51,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:18:51,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:51,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429509502] [2025-03-17 14:18:51,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429509502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:51,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:51,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:18:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104025749] [2025-03-17 14:18:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:51,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:18:51,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:51,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:18:51,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:18:51,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:51,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 35.55555555555556) internal successors, (320), 9 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:51,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:51,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:51,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:52,286 INFO L124 PetriNetUnfolderBase]: 678/1414 cut-off events. [2025-03-17 14:18:52,287 INFO L125 PetriNetUnfolderBase]: For 1592/1606 co-relation queries the response was YES. [2025-03-17 14:18:52,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 1414 events. 678/1414 cut-off events. For 1592/1606 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8295 event pairs, 97 based on Foata normal form. 29/1284 useless extension candidates. Maximal degree in co-relation 4011. Up to 610 conditions per place. [2025-03-17 14:18:52,294 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 111 selfloop transitions, 53 changer transitions 0/176 dead transitions. [2025-03-17 14:18:52,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 176 transitions, 1107 flow [2025-03-17 14:18:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:18:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:18:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 521 transitions. [2025-03-17 14:18:52,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6315151515151515 [2025-03-17 14:18:52,298 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 387 flow. Second operand 11 states and 521 transitions. [2025-03-17 14:18:52,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 176 transitions, 1107 flow [2025-03-17 14:18:52,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 176 transitions, 1107 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:18:52,311 INFO L231 Difference]: Finished difference. Result has 80 places, 104 transitions, 785 flow [2025-03-17 14:18:52,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=785, PETRI_PLACES=80, PETRI_TRANSITIONS=104} [2025-03-17 14:18:52,312 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2025-03-17 14:18:52,312 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 104 transitions, 785 flow [2025-03-17 14:18:52,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.55555555555556) internal successors, (320), 9 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:52,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:52,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:18:52,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash 812675863, now seen corresponding path program 2 times [2025-03-17 14:18:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517613050] [2025-03-17 14:18:52,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:18:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:52,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:18:52,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-17 14:18:52,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:18:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:18:52,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517613050] [2025-03-17 14:18:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517613050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:52,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254482493] [2025-03-17 14:18:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:52,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:18:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:52,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:18:52,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:18:52,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-03-17 14:18:52,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 104 transitions, 785 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:52,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:52,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-03-17 14:18:52,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:52,756 INFO L124 PetriNetUnfolderBase]: 782/1705 cut-off events. [2025-03-17 14:18:52,757 INFO L125 PetriNetUnfolderBase]: For 3749/3777 co-relation queries the response was YES. [2025-03-17 14:18:52,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 1705 events. 782/1705 cut-off events. For 3749/3777 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10552 event pairs, 123 based on Foata normal form. 25/1586 useless extension candidates. Maximal degree in co-relation 5943. Up to 530 conditions per place. [2025-03-17 14:18:52,787 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 115 selfloop transitions, 20 changer transitions 0/175 dead transitions. [2025-03-17 14:18:52,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 175 transitions, 1546 flow [2025-03-17 14:18:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:18:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:18:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 258 transitions. [2025-03-17 14:18:52,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.688 [2025-03-17 14:18:52,789 INFO L175 Difference]: Start difference. First operand has 80 places, 104 transitions, 785 flow. Second operand 5 states and 258 transitions. [2025-03-17 14:18:52,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 175 transitions, 1546 flow [2025-03-17 14:18:52,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 175 transitions, 1420 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:18:52,801 INFO L231 Difference]: Finished difference. Result has 80 places, 111 transitions, 806 flow [2025-03-17 14:18:52,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=806, PETRI_PLACES=80, PETRI_TRANSITIONS=111} [2025-03-17 14:18:52,801 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2025-03-17 14:18:52,801 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 111 transitions, 806 flow [2025-03-17 14:18:52,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:52,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:52,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:52,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:18:52,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash -686432781, now seen corresponding path program 3 times [2025-03-17 14:18:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998846546] [2025-03-17 14:18:52,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:18:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:52,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:18:52,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-17 14:18:52,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:18:52,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:18:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:52,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998846546] [2025-03-17 14:18:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998846546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361129710] [2025-03-17 14:18:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:52,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:18:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:52,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:18:52,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:18:52,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-03-17 14:18:52,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 111 transitions, 806 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:52,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:52,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-03-17 14:18:52,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:53,213 INFO L124 PetriNetUnfolderBase]: 791/1778 cut-off events. [2025-03-17 14:18:53,213 INFO L125 PetriNetUnfolderBase]: For 4551/4576 co-relation queries the response was YES. [2025-03-17 14:18:53,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 1778 events. 791/1778 cut-off events. For 4551/4576 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11162 event pairs, 125 based on Foata normal form. 41/1666 useless extension candidates. Maximal degree in co-relation 6501. Up to 609 conditions per place. [2025-03-17 14:18:53,223 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 134 selfloop transitions, 26 changer transitions 0/200 dead transitions. [2025-03-17 14:18:53,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 200 transitions, 1699 flow [2025-03-17 14:18:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:18:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:18:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2025-03-17 14:18:53,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736 [2025-03-17 14:18:53,225 INFO L175 Difference]: Start difference. First operand has 80 places, 111 transitions, 806 flow. Second operand 5 states and 276 transitions. [2025-03-17 14:18:53,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 200 transitions, 1699 flow [2025-03-17 14:18:53,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 200 transitions, 1685 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 14:18:53,238 INFO L231 Difference]: Finished difference. Result has 86 places, 127 transitions, 1053 flow [2025-03-17 14:18:53,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1053, PETRI_PLACES=86, PETRI_TRANSITIONS=127} [2025-03-17 14:18:53,239 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2025-03-17 14:18:53,239 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 127 transitions, 1053 flow [2025-03-17 14:18:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:53,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:53,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:53,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:18:53,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -930862585, now seen corresponding path program 4 times [2025-03-17 14:18:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875376020] [2025-03-17 14:18:53,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:18:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:53,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:18:53,250 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-17 14:18:53,250 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:18:53,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:18:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875376020] [2025-03-17 14:18:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875376020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150926573] [2025-03-17 14:18:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:53,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:18:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:53,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:18:53,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:18:53,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-03-17 14:18:53,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 127 transitions, 1053 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:53,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:53,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-03-17 14:18:53,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:53,632 INFO L124 PetriNetUnfolderBase]: 761/1713 cut-off events. [2025-03-17 14:18:53,632 INFO L125 PetriNetUnfolderBase]: For 6605/6638 co-relation queries the response was YES. [2025-03-17 14:18:53,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 1713 events. 761/1713 cut-off events. For 6605/6638 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10423 event pairs, 18 based on Foata normal form. 34/1617 useless extension candidates. Maximal degree in co-relation 6890. Up to 723 conditions per place. [2025-03-17 14:18:53,641 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 105 selfloop transitions, 34 changer transitions 0/170 dead transitions. [2025-03-17 14:18:53,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 170 transitions, 1545 flow [2025-03-17 14:18:53,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:18:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:18:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2025-03-17 14:18:53,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7013333333333334 [2025-03-17 14:18:53,643 INFO L175 Difference]: Start difference. First operand has 86 places, 127 transitions, 1053 flow. Second operand 5 states and 263 transitions. [2025-03-17 14:18:53,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 170 transitions, 1545 flow [2025-03-17 14:18:53,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 170 transitions, 1482 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-03-17 14:18:53,656 INFO L231 Difference]: Finished difference. Result has 91 places, 123 transitions, 1052 flow [2025-03-17 14:18:53,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1052, PETRI_PLACES=91, PETRI_TRANSITIONS=123} [2025-03-17 14:18:53,657 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-03-17 14:18:53,657 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 123 transitions, 1052 flow [2025-03-17 14:18:53,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:53,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:53,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:53,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:18:53,657 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:53,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1445811983, now seen corresponding path program 5 times [2025-03-17 14:18:53,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:53,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395439932] [2025-03-17 14:18:53,658 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:18:53,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:53,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:18:53,667 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:18:53,667 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:18:53,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:53,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395439932] [2025-03-17 14:18:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395439932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:53,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:53,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:18:53,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731418967] [2025-03-17 14:18:53,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:53,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:18:53,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:53,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:18:53,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:18:54,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:54,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 123 transitions, 1052 flow. Second operand has 11 states, 11 states have (on average 35.45454545454545) internal successors, (390), 11 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:54,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:54,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:54,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:54,720 INFO L124 PetriNetUnfolderBase]: 1146/2450 cut-off events. [2025-03-17 14:18:54,720 INFO L125 PetriNetUnfolderBase]: For 10222/10248 co-relation queries the response was YES. [2025-03-17 14:18:54,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10132 conditions, 2450 events. 1146/2450 cut-off events. For 10222/10248 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15610 event pairs, 382 based on Foata normal form. 28/2298 useless extension candidates. Maximal degree in co-relation 10102. Up to 1453 conditions per place. [2025-03-17 14:18:54,733 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 189 selfloop transitions, 46 changer transitions 0/252 dead transitions. [2025-03-17 14:18:54,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 252 transitions, 2455 flow [2025-03-17 14:18:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:18:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:18:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 637 transitions. [2025-03-17 14:18:54,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2025-03-17 14:18:54,735 INFO L175 Difference]: Start difference. First operand has 91 places, 123 transitions, 1052 flow. Second operand 14 states and 637 transitions. [2025-03-17 14:18:54,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 252 transitions, 2455 flow [2025-03-17 14:18:54,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 252 transitions, 2360 flow, removed 33 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:54,753 INFO L231 Difference]: Finished difference. Result has 110 places, 144 transitions, 1353 flow [2025-03-17 14:18:54,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1353, PETRI_PLACES=110, PETRI_TRANSITIONS=144} [2025-03-17 14:18:54,753 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 42 predicate places. [2025-03-17 14:18:54,754 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 144 transitions, 1353 flow [2025-03-17 14:18:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.45454545454545) internal successors, (390), 11 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:54,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:54,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:18:54,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1181561771, now seen corresponding path program 1 times [2025-03-17 14:18:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381478207] [2025-03-17 14:18:54,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:54,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:18:54,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:18:54,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381478207] [2025-03-17 14:18:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381478207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:18:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676585530] [2025-03-17 14:18:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:54,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:18:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:54,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:18:54,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:18:55,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:55,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 144 transitions, 1353 flow. Second operand has 12 states, 12 states have (on average 35.416666666666664) internal successors, (425), 12 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:55,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:55,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:55,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:55,976 INFO L124 PetriNetUnfolderBase]: 1412/3030 cut-off events. [2025-03-17 14:18:55,976 INFO L125 PetriNetUnfolderBase]: For 15723/15748 co-relation queries the response was YES. [2025-03-17 14:18:55,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13748 conditions, 3030 events. 1412/3030 cut-off events. For 15723/15748 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 20303 event pairs, 643 based on Foata normal form. 27/2827 useless extension candidates. Maximal degree in co-relation 13710. Up to 1995 conditions per place. [2025-03-17 14:18:55,995 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 210 selfloop transitions, 51 changer transitions 0/278 dead transitions. [2025-03-17 14:18:55,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 278 transitions, 2945 flow [2025-03-17 14:18:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:18:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:18:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 643 transitions. [2025-03-17 14:18:55,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6123809523809524 [2025-03-17 14:18:55,997 INFO L175 Difference]: Start difference. First operand has 110 places, 144 transitions, 1353 flow. Second operand 14 states and 643 transitions. [2025-03-17 14:18:55,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 278 transitions, 2945 flow [2025-03-17 14:18:56,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 278 transitions, 2887 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-17 14:18:56,030 INFO L231 Difference]: Finished difference. Result has 129 places, 178 transitions, 1854 flow [2025-03-17 14:18:56,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1854, PETRI_PLACES=129, PETRI_TRANSITIONS=178} [2025-03-17 14:18:56,031 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2025-03-17 14:18:56,031 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 178 transitions, 1854 flow [2025-03-17 14:18:56,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.416666666666664) internal successors, (425), 12 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:56,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:56,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:18:56,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:56,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash -124257545, now seen corresponding path program 2 times [2025-03-17 14:18:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:56,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147202074] [2025-03-17 14:18:56,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:18:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:56,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 14:18:56,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:18:56,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:18:56,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:56,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:56,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147202074] [2025-03-17 14:18:56,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147202074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:56,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:56,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:18:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916613126] [2025-03-17 14:18:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:56,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:18:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:56,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:18:56,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:18:56,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:56,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 1854 flow. Second operand has 12 states, 12 states have (on average 35.416666666666664) internal successors, (425), 12 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:56,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:56,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:56,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:57,354 INFO L124 PetriNetUnfolderBase]: 1737/3685 cut-off events. [2025-03-17 14:18:57,355 INFO L125 PetriNetUnfolderBase]: For 24290/24325 co-relation queries the response was YES. [2025-03-17 14:18:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18477 conditions, 3685 events. 1737/3685 cut-off events. For 24290/24325 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 25852 event pairs, 720 based on Foata normal form. 38/3459 useless extension candidates. Maximal degree in co-relation 18429. Up to 2445 conditions per place. [2025-03-17 14:18:57,378 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 268 selfloop transitions, 66 changer transitions 0/351 dead transitions. [2025-03-17 14:18:57,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 351 transitions, 4092 flow [2025-03-17 14:18:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:18:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 14:18:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 772 transitions. [2025-03-17 14:18:57,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054901960784314 [2025-03-17 14:18:57,381 INFO L175 Difference]: Start difference. First operand has 129 places, 178 transitions, 1854 flow. Second operand 17 states and 772 transitions. [2025-03-17 14:18:57,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 351 transitions, 4092 flow [2025-03-17 14:18:57,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 351 transitions, 3999 flow, removed 37 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:57,429 INFO L231 Difference]: Finished difference. Result has 154 places, 210 transitions, 2422 flow [2025-03-17 14:18:57,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2422, PETRI_PLACES=154, PETRI_TRANSITIONS=210} [2025-03-17 14:18:57,430 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 86 predicate places. [2025-03-17 14:18:57,430 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 210 transitions, 2422 flow [2025-03-17 14:18:57,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.416666666666664) internal successors, (425), 12 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:57,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:57,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:57,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:18:57,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1337233237, now seen corresponding path program 3 times [2025-03-17 14:18:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152296897] [2025-03-17 14:18:57,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:18:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:57,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-17 14:18:57,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:18:57,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:18:57,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152296897] [2025-03-17 14:18:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152296897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:57,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:18:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164179279] [2025-03-17 14:18:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:18:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:57,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:18:57,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:18:57,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:57,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 210 transitions, 2422 flow. Second operand has 12 states, 12 states have (on average 35.416666666666664) internal successors, (425), 12 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:57,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:57,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:58,591 INFO L124 PetriNetUnfolderBase]: 1963/4137 cut-off events. [2025-03-17 14:18:58,592 INFO L125 PetriNetUnfolderBase]: For 34811/34854 co-relation queries the response was YES. [2025-03-17 14:18:58,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22464 conditions, 4137 events. 1963/4137 cut-off events. For 34811/34854 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 29992 event pairs, 840 based on Foata normal form. 44/3875 useless extension candidates. Maximal degree in co-relation 22405. Up to 2873 conditions per place. [2025-03-17 14:18:58,622 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 269 selfloop transitions, 63 changer transitions 0/349 dead transitions. [2025-03-17 14:18:58,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 349 transitions, 4431 flow [2025-03-17 14:18:58,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:18:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:18:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 648 transitions. [2025-03-17 14:18:58,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-03-17 14:18:58,623 INFO L175 Difference]: Start difference. First operand has 154 places, 210 transitions, 2422 flow. Second operand 14 states and 648 transitions. [2025-03-17 14:18:58,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 349 transitions, 4431 flow [2025-03-17 14:18:58,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 349 transitions, 4249 flow, removed 87 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:58,734 INFO L231 Difference]: Finished difference. Result has 170 places, 224 transitions, 2666 flow [2025-03-17 14:18:58,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2666, PETRI_PLACES=170, PETRI_TRANSITIONS=224} [2025-03-17 14:18:58,734 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 102 predicate places. [2025-03-17 14:18:58,735 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 224 transitions, 2666 flow [2025-03-17 14:18:58,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.416666666666664) internal successors, (425), 12 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:58,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:58,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:58,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:18:58,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:18:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash 75625283, now seen corresponding path program 1 times [2025-03-17 14:18:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348317770] [2025-03-17 14:18:58,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:58,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:18:58,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:18:58,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:58,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348317770] [2025-03-17 14:18:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348317770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:18:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105836282] [2025-03-17 14:18:58,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:58,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:18:58,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:18:58,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:18:58,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:18:58,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:18:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:59,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 14:18:59,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:18:59,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 14:18:59,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 14:18:59,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:18:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:59,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:18:59,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-17 14:18:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:59,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105836282] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:18:59,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:18:59,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 20 [2025-03-17 14:18:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383555347] [2025-03-17 14:18:59,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:59,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:18:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:59,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:18:59,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-17 14:18:59,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-17 14:18:59,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 224 transitions, 2666 flow. Second operand has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:59,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:59,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-17 14:18:59,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:19:00,828 INFO L124 PetriNetUnfolderBase]: 2754/5900 cut-off events. [2025-03-17 14:19:00,828 INFO L125 PetriNetUnfolderBase]: For 55835/55877 co-relation queries the response was YES. [2025-03-17 14:19:00,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31958 conditions, 5900 events. 2754/5900 cut-off events. For 55835/55877 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 46165 event pairs, 858 based on Foata normal form. 49/5486 useless extension candidates. Maximal degree in co-relation 31893. Up to 1782 conditions per place. [2025-03-17 14:19:00,869 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 336 selfloop transitions, 103 changer transitions 0/460 dead transitions. [2025-03-17 14:19:00,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 460 transitions, 6104 flow [2025-03-17 14:19:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:19:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:19:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 672 transitions. [2025-03-17 14:19:00,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-17 14:19:00,870 INFO L175 Difference]: Start difference. First operand has 170 places, 224 transitions, 2666 flow. Second operand 14 states and 672 transitions. [2025-03-17 14:19:00,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 460 transitions, 6104 flow [2025-03-17 14:19:00,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 460 transitions, 5834 flow, removed 81 selfloop flow, removed 9 redundant places. [2025-03-17 14:19:00,969 INFO L231 Difference]: Finished difference. Result has 182 places, 275 transitions, 3556 flow [2025-03-17 14:19:00,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3556, PETRI_PLACES=182, PETRI_TRANSITIONS=275} [2025-03-17 14:19:00,970 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 114 predicate places. [2025-03-17 14:19:00,970 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 275 transitions, 3556 flow [2025-03-17 14:19:00,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:00,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:19:00,970 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:19:00,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:19:01,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:19:01,171 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:19:01,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:19:01,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1258707442, now seen corresponding path program 1 times [2025-03-17 14:19:01,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:19:01,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643015606] [2025-03-17 14:19:01,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:19:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:19:01,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:19:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:19:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:19:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:19:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:01,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:19:01,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643015606] [2025-03-17 14:19:01,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643015606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:19:01,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:19:01,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:19:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678644062] [2025-03-17 14:19:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:19:01,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:19:01,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:19:01,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:19:01,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:19:01,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-17 14:19:01,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 275 transitions, 3556 flow. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:01,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:19:01,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-17 14:19:01,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:19:02,102 INFO L124 PetriNetUnfolderBase]: 2657/5722 cut-off events. [2025-03-17 14:19:02,102 INFO L125 PetriNetUnfolderBase]: For 66171/66204 co-relation queries the response was YES. [2025-03-17 14:19:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32742 conditions, 5722 events. 2657/5722 cut-off events. For 66171/66204 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 43364 event pairs, 1312 based on Foata normal form. 13/5258 useless extension candidates. Maximal degree in co-relation 32669. Up to 4844 conditions per place. [2025-03-17 14:19:02,148 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 215 selfloop transitions, 10 changer transitions 22/264 dead transitions. [2025-03-17 14:19:02,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 264 transitions, 3805 flow [2025-03-17 14:19:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:19:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:19:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2025-03-17 14:19:02,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2025-03-17 14:19:02,149 INFO L175 Difference]: Start difference. First operand has 182 places, 275 transitions, 3556 flow. Second operand 6 states and 268 transitions. [2025-03-17 14:19:02,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 264 transitions, 3805 flow [2025-03-17 14:19:02,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 264 transitions, 3522 flow, removed 110 selfloop flow, removed 5 redundant places. [2025-03-17 14:19:02,343 INFO L231 Difference]: Finished difference. Result has 184 places, 238 transitions, 2797 flow [2025-03-17 14:19:02,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2878, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2797, PETRI_PLACES=184, PETRI_TRANSITIONS=238} [2025-03-17 14:19:02,344 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 116 predicate places. [2025-03-17 14:19:02,344 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 238 transitions, 2797 flow [2025-03-17 14:19:02,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:02,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:19:02,344 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:19:02,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:19:02,344 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:19:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:19:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1299316834, now seen corresponding path program 1 times [2025-03-17 14:19:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:19:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809789433] [2025-03-17 14:19:02,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:19:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:19:02,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:19:02,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:19:02,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:19:02,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:19:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:19:02,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809789433] [2025-03-17 14:19:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809789433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:19:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:19:02,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 14:19:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001298931] [2025-03-17 14:19:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:19:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:19:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:19:02,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:19:02,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:19:03,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-17 14:19:03,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 238 transitions, 2797 flow. Second operand has 16 states, 16 states have (on average 34.4375) internal successors, (551), 16 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:03,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:19:03,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-17 14:19:03,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:19:05,192 INFO L124 PetriNetUnfolderBase]: 4832/9833 cut-off events. [2025-03-17 14:19:05,193 INFO L125 PetriNetUnfolderBase]: For 118601/118935 co-relation queries the response was YES. [2025-03-17 14:19:05,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56137 conditions, 9833 events. 4832/9833 cut-off events. For 118601/118935 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 73806 event pairs, 1481 based on Foata normal form. 255/9279 useless extension candidates. Maximal degree in co-relation 56062. Up to 4756 conditions per place. [2025-03-17 14:19:05,265 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 376 selfloop transitions, 214 changer transitions 4/616 dead transitions. [2025-03-17 14:19:05,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 616 transitions, 8262 flow [2025-03-17 14:19:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:19:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 14:19:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1021 transitions. [2025-03-17 14:19:05,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5672222222222222 [2025-03-17 14:19:05,267 INFO L175 Difference]: Start difference. First operand has 184 places, 238 transitions, 2797 flow. Second operand 24 states and 1021 transitions. [2025-03-17 14:19:05,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 616 transitions, 8262 flow [2025-03-17 14:19:05,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 616 transitions, 8067 flow, removed 58 selfloop flow, removed 11 redundant places. [2025-03-17 14:19:05,471 INFO L231 Difference]: Finished difference. Result has 206 places, 432 transitions, 6111 flow [2025-03-17 14:19:05,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2735, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6111, PETRI_PLACES=206, PETRI_TRANSITIONS=432} [2025-03-17 14:19:05,471 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 138 predicate places. [2025-03-17 14:19:05,471 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 432 transitions, 6111 flow [2025-03-17 14:19:05,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 34.4375) internal successors, (551), 16 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:05,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:19:05,472 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:19:05,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:19:05,472 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:19:05,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:19:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2131577170, now seen corresponding path program 2 times [2025-03-17 14:19:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:19:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757083438] [2025-03-17 14:19:05,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:19:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:19:05,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:19:05,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:19:05,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:19:05,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:19:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:05,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:19:05,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757083438] [2025-03-17 14:19:05,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757083438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:19:05,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60496212] [2025-03-17 14:19:05,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:19:05,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:19:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:19:05,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:19:05,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:19:05,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:19:05,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:19:05,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:19:05,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:19:05,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 14:19:05,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:19:06,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 14:19:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:06,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:19:06,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-17 14:19:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:19:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60496212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:19:06,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:19:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 22 [2025-03-17 14:19:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536163764] [2025-03-17 14:19:06,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:19:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 14:19:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:19:06,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 14:19:06,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:19:06,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:19:06,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 432 transitions, 6111 flow. Second operand has 22 states, 22 states have (on average 36.90909090909091) internal successors, (812), 22 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:06,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:19:06,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:19:06,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:19:08,629 INFO L124 PetriNetUnfolderBase]: 1236/3030 cut-off events. [2025-03-17 14:19:08,629 INFO L125 PetriNetUnfolderBase]: For 53100/53160 co-relation queries the response was YES. [2025-03-17 14:19:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19693 conditions, 3030 events. 1236/3030 cut-off events. For 53100/53160 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 20264 event pairs, 8 based on Foata normal form. 206/3094 useless extension candidates. Maximal degree in co-relation 19615. Up to 658 conditions per place. [2025-03-17 14:19:08,657 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 248 selfloop transitions, 359 changer transitions 9/633 dead transitions. [2025-03-17 14:19:08,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 633 transitions, 10119 flow [2025-03-17 14:19:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-17 14:19:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-17 14:19:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1784 transitions. [2025-03-17 14:19:08,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5406060606060606 [2025-03-17 14:19:08,660 INFO L175 Difference]: Start difference. First operand has 206 places, 432 transitions, 6111 flow. Second operand 44 states and 1784 transitions. [2025-03-17 14:19:08,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 633 transitions, 10119 flow [2025-03-17 14:19:08,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 633 transitions, 8682 flow, removed 310 selfloop flow, removed 20 redundant places. [2025-03-17 14:19:08,822 INFO L231 Difference]: Finished difference. Result has 235 places, 478 transitions, 7505 flow [2025-03-17 14:19:08,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3276, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=7505, PETRI_PLACES=235, PETRI_TRANSITIONS=478} [2025-03-17 14:19:08,823 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 167 predicate places. [2025-03-17 14:19:08,823 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 478 transitions, 7505 flow [2025-03-17 14:19:08,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 36.90909090909091) internal successors, (812), 22 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:08,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:19:08,823 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:19:08,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:19:09,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 14:19:09,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-17 14:19:09,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:19:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash 42899768, now seen corresponding path program 3 times [2025-03-17 14:19:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:19:09,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846636655] [2025-03-17 14:19:09,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:19:09,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:19:09,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-17 14:19:09,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:19:09,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:19:09,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:19:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:09,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:19:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846636655] [2025-03-17 14:19:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846636655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:19:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545992981] [2025-03-17 14:19:09,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:19:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:19:09,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:19:09,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:19:09,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:19:09,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-17 14:19:09,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:19:09,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:19:09,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:19:09,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 14:19:09,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:19:09,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 14:19:09,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 14:19:09,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 14:19:09,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:19:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:09,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:19:10,503 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2025-03-17 14:19:10,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 69 [2025-03-17 14:19:10,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:19:10,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 57 [2025-03-17 14:19:10,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 14:19:10,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:19:10,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 84 [2025-03-17 14:19:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:19:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545992981] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:19:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:19:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15, 12] total 36 [2025-03-17 14:19:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979887778] [2025-03-17 14:19:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:19:10,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:19:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:19:10,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:19:10,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 14:19:15,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:19:19,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:19:20,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-17 14:19:20,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 478 transitions, 7505 flow. Second operand has 13 states, 13 states have (on average 34.92307692307692) internal successors, (454), 13 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:19:20,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:19:20,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-17 14:19:20,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:19:25,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:19:47,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 21.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:19:51,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:19:56,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:20:00,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]