./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:57:30,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:57:30,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:57:30,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:57:30,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:57:30,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:57:30,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:57:30,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:57:30,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:57:30,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:57:30,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:57:30,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:57:30,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:57:30,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:30,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:30,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:30,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:57:30,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-01-10 00:57:30,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:57:30,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:57:30,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:57:30,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:57:30,774 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:57:30,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-10 00:57:31,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f054eaf3/bc46c267599b4efca3c7733ab3e44729/FLAGf9e72a7ea [2025-01-10 00:57:32,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:57:32,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-10 00:57:32,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f054eaf3/bc46c267599b4efca3c7733ab3e44729/FLAGf9e72a7ea [2025-01-10 00:57:32,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f054eaf3/bc46c267599b4efca3c7733ab3e44729 [2025-01-10 00:57:32,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:57:32,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:57:32,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:32,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:57:32,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:57:32,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fadb9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32, skipping insertion in model container [2025-01-10 00:57:32,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:57:32,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:32,517 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:57:32,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:32,580 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:57:32,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32 WrapperNode [2025-01-10 00:57:32,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:32,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:32,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:57:32,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:57:32,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,606 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 116 [2025-01-10 00:57:32,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:32,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:57:32,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:57:32,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:57:32,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,622 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-01-10 00:57:32,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:57:32,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:57:32,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:57:32,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:57:32,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (1/1) ... [2025-01-10 00:57:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:32,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:57:32,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:57:32,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:57:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:57:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:57:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-01-10 00:57:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-01-10 00:57:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:57:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:57:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:57:32,696 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:57:32,796 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:57:32,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:57:33,012 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:57:33,013 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:57:33,128 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:57:33,132 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:57:33,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:33 BoogieIcfgContainer [2025-01-10 00:57:33,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:57:33,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:57:33,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:57:33,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:57:33,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:32" (1/3) ... [2025-01-10 00:57:33,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6301f47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:33, skipping insertion in model container [2025-01-10 00:57:33,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:32" (2/3) ... [2025-01-10 00:57:33,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6301f47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:33, skipping insertion in model container [2025-01-10 00:57:33,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:33" (3/3) ... [2025-01-10 00:57:33,142 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-10 00:57:33,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:57:33,153 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-01-10 00:57:33,153 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:57:33,209 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:57:33,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 154 flow [2025-01-10 00:57:33,290 INFO L124 PetriNetUnfolderBase]: 10/74 cut-off events. [2025-01-10 00:57:33,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:33,296 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 217 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-01-10 00:57:33,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 75 transitions, 154 flow [2025-01-10 00:57:33,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 74 transitions, 151 flow [2025-01-10 00:57:33,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:33,314 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;@5f2fe4f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:33,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-10 00:57:33,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:33,318 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 00:57:33,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:33,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:33,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:57:33,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:33,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash 12710, now seen corresponding path program 1 times [2025-01-10 00:57:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305411652] [2025-01-10 00:57:33,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:33,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:57:33,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:57:33,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:33,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305411652] [2025-01-10 00:57:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305411652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:33,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948600719] [2025-01-10 00:57:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:33,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:33,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:33,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-01-10 00:57:33,611 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-01-10 00:57:33,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:33,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-01-10 00:57:33,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:33,784 INFO L124 PetriNetUnfolderBase]: 198/607 cut-off events. [2025-01-10 00:57:33,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:33,786 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 45. Compared 3772 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-01-10 00:57:33,791 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-01-10 00:57:33,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 193 flow [2025-01-10 00:57:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-01-10 00:57:33,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-01-10 00:57:33,804 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 151 flow. Second operand 3 states and 145 transitions. [2025-01-10 00:57:33,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 193 flow [2025-01-10 00:57:33,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:33,813 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 136 flow [2025-01-10 00:57:33,815 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-01-10 00:57:33,819 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2025-01-10 00:57:33,820 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 136 flow [2025-01-10 00:57:33,820 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-01-10 00:57:33,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:33,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:57:33,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:57:33,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash 12711, now seen corresponding path program 1 times [2025-01-10 00:57:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680732630] [2025-01-10 00:57:33,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:33,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:57:33,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:57:33,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:33,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680732630] [2025-01-10 00:57:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680732630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660522772] [2025-01-10 00:57:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:33,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:33,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:33,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-01-10 00:57:33,966 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-01-10 00:57:33,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:33,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-01-10 00:57:33,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:34,092 INFO L124 PetriNetUnfolderBase]: 198/606 cut-off events. [2025-01-10 00:57:34,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:34,094 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 45. Compared 3760 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-01-10 00:57:34,096 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-10 00:57:34,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 194 flow [2025-01-10 00:57:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-10 00:57:34,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-01-10 00:57:34,097 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 136 flow. Second operand 3 states and 139 transitions. [2025-01-10 00:57:34,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 194 flow [2025-01-10 00:57:34,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:34,099 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 134 flow [2025-01-10 00:57:34,099 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-01-10 00:57:34,099 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-01-10 00:57:34,099 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 134 flow [2025-01-10 00:57:34,099 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-01-10 00:57:34,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:34,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:57:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:57:34,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1131369546, now seen corresponding path program 1 times [2025-01-10 00:57:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002955291] [2025-01-10 00:57:34,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:57:34,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:57:34,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:34,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002955291] [2025-01-10 00:57:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002955291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:34,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:34,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:34,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757255571] [2025-01-10 00:57:34,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:34,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:34,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:34,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:34,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-01-10 00:57:34,178 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-01-10 00:57:34,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:34,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-01-10 00:57:34,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:34,252 INFO L124 PetriNetUnfolderBase]: 198/604 cut-off events. [2025-01-10 00:57:34,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:34,253 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 45. Compared 3751 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-01-10 00:57:34,256 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 29 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-01-10 00:57:34,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 192 flow [2025-01-10 00:57:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-10 00:57:34,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-01-10 00:57:34,257 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 134 flow. Second operand 3 states and 139 transitions. [2025-01-10 00:57:34,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 192 flow [2025-01-10 00:57:34,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:34,258 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 130 flow [2025-01-10 00:57:34,258 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-01-10 00:57:34,259 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-01-10 00:57:34,259 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 130 flow [2025-01-10 00:57:34,259 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-01-10 00:57:34,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:34,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:34,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:57:34,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -619385469, now seen corresponding path program 1 times [2025-01-10 00:57:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720969132] [2025-01-10 00:57:34,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:34,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:57:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:57:34,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720969132] [2025-01-10 00:57:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720969132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:34,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464259418] [2025-01-10 00:57:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:34,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:34,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:34,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:34,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-01-10 00:57:34,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:34,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:34,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-01-10 00:57:34,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:34,538 INFO L124 PetriNetUnfolderBase]: 234/607 cut-off events. [2025-01-10 00:57:34,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:34,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 607 events. 234/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3573 event pairs, 53 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 1032. Up to 283 conditions per place. [2025-01-10 00:57:34,541 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 45 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-01-10 00:57:34,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 256 flow [2025-01-10 00:57:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2025-01-10 00:57:34,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5653333333333334 [2025-01-10 00:57:34,543 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 130 flow. Second operand 5 states and 212 transitions. [2025-01-10 00:57:34,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 256 flow [2025-01-10 00:57:34,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:34,545 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 131 flow [2025-01-10 00:57:34,545 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2025-01-10 00:57:34,545 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-01-10 00:57:34,545 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 131 flow [2025-01-10 00:57:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:34,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:34,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:34,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:57:34,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:34,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash -619385468, now seen corresponding path program 1 times [2025-01-10 00:57:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:34,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209159222] [2025-01-10 00:57:34,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:34,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:34,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:57:34,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:57:34,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:34,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209159222] [2025-01-10 00:57:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209159222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:34,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:34,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:34,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901080511] [2025-01-10 00:57:34,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:34,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:34,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:34,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:34,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-01-10 00:57:34,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:34,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:34,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-01-10 00:57:34,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:34,919 INFO L124 PetriNetUnfolderBase]: 234/556 cut-off events. [2025-01-10 00:57:34,920 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:57:34,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 556 events. 234/556 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3061 event pairs, 53 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1017. Up to 283 conditions per place. [2025-01-10 00:57:34,925 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 45 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-01-10 00:57:34,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 257 flow [2025-01-10 00:57:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2025-01-10 00:57:34,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5653333333333334 [2025-01-10 00:57:34,927 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 131 flow. Second operand 5 states and 212 transitions. [2025-01-10 00:57:34,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 257 flow [2025-01-10 00:57:34,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 249 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:34,930 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 125 flow [2025-01-10 00:57:34,930 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2025-01-10 00:57:34,930 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2025-01-10 00:57:34,931 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 125 flow [2025-01-10 00:57:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:34,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:34,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:34,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:57:34,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash -552293062, now seen corresponding path program 1 times [2025-01-10 00:57:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121890371] [2025-01-10 00:57:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:34,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:57:34,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:57:34,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:34,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121890371] [2025-01-10 00:57:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121890371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629777499] [2025-01-10 00:57:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:34,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:34,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:35,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-01-10 00:57:35,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:35,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:35,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-01-10 00:57:35,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:35,159 INFO L124 PetriNetUnfolderBase]: 223/541 cut-off events. [2025-01-10 00:57:35,159 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 00:57:35,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 541 events. 223/541 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2854 event pairs, 68 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 975. Up to 362 conditions per place. [2025-01-10 00:57:35,162 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 38 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-01-10 00:57:35,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 221 flow [2025-01-10 00:57:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-01-10 00:57:35,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5146666666666667 [2025-01-10 00:57:35,163 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 125 flow. Second operand 5 states and 193 transitions. [2025-01-10 00:57:35,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 221 flow [2025-01-10 00:57:35,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 209 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:35,166 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 113 flow [2025-01-10 00:57:35,166 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-01-10 00:57:35,167 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2025-01-10 00:57:35,168 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 113 flow [2025-01-10 00:57:35,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:35,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:35,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:35,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:57:35,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:35,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash -552293061, now seen corresponding path program 1 times [2025-01-10 00:57:35,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:35,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071556188] [2025-01-10 00:57:35,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:35,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:57:35,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:57:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071556188] [2025-01-10 00:57:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071556188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973375600] [2025-01-10 00:57:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:35,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:35,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:35,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-01-10 00:57:35,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:35,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:35,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-01-10 00:57:35,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:35,493 INFO L124 PetriNetUnfolderBase]: 212/488 cut-off events. [2025-01-10 00:57:35,493 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 00:57:35,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 488 events. 212/488 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2411 event pairs, 8 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 909. Up to 359 conditions per place. [2025-01-10 00:57:35,495 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 38 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-01-10 00:57:35,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 205 flow [2025-01-10 00:57:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-01-10 00:57:35,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5146666666666667 [2025-01-10 00:57:35,496 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 113 flow. Second operand 5 states and 193 transitions. [2025-01-10 00:57:35,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 205 flow [2025-01-10 00:57:35,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 197 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:35,497 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 101 flow [2025-01-10 00:57:35,497 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-01-10 00:57:35,498 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2025-01-10 00:57:35,498 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 101 flow [2025-01-10 00:57:35,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:35,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:35,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:35,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:57:35,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:35,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 478539532, now seen corresponding path program 1 times [2025-01-10 00:57:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158965263] [2025-01-10 00:57:35,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:35,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:57:35,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:57:35,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158965263] [2025-01-10 00:57:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158965263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:35,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:35,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:57:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963694301] [2025-01-10 00:57:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:35,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:35,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:35,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:35,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:35,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 101 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-01-10 00:57:35,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:35,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:35,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:35,953 INFO L124 PetriNetUnfolderBase]: 453/952 cut-off events. [2025-01-10 00:57:35,953 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 00:57:35,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 952 events. 453/952 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4988 event pairs, 24 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1840. Up to 426 conditions per place. [2025-01-10 00:57:35,957 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 79 selfloop transitions, 16 changer transitions 0/107 dead transitions. [2025-01-10 00:57:35,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 107 transitions, 419 flow [2025-01-10 00:57:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:57:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:57:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 335 transitions. [2025-01-10 00:57:35,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-01-10 00:57:35,960 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 101 flow. Second operand 7 states and 335 transitions. [2025-01-10 00:57:35,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 107 transitions, 419 flow [2025-01-10 00:57:35,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 407 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:35,966 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 197 flow [2025-01-10 00:57:35,967 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-01-10 00:57:35,967 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2025-01-10 00:57:35,968 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 197 flow [2025-01-10 00:57:35,969 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-01-10 00:57:35,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:35,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:35,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:57:35,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 479246479, now seen corresponding path program 1 times [2025-01-10 00:57:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211151704] [2025-01-10 00:57:35,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:35,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:57:35,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:57:35,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:35,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:36,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211151704] [2025-01-10 00:57:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211151704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:36,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:36,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:57:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350695091] [2025-01-10 00:57:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:36,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:36,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:36,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:36,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-01-10 00:57:36,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:36,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:36,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-01-10 00:57:36,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:36,340 INFO L124 PetriNetUnfolderBase]: 299/652 cut-off events. [2025-01-10 00:57:36,341 INFO L125 PetriNetUnfolderBase]: For 187/196 co-relation queries the response was YES. [2025-01-10 00:57:36,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 652 events. 299/652 cut-off events. For 187/196 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3005 event pairs, 124 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1450. Up to 407 conditions per place. [2025-01-10 00:57:36,344 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 67 selfloop transitions, 10 changer transitions 6/97 dead transitions. [2025-01-10 00:57:36,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 433 flow [2025-01-10 00:57:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:57:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:57:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2025-01-10 00:57:36,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6247619047619047 [2025-01-10 00:57:36,345 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 197 flow. Second operand 7 states and 328 transitions. [2025-01-10 00:57:36,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 433 flow [2025-01-10 00:57:36,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 427 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:36,348 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 217 flow [2025-01-10 00:57:36,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-01-10 00:57:36,348 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-01-10 00:57:36,349 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 217 flow [2025-01-10 00:57:36,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:36,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:36,349 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-01-10 00:57:36,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:57:36,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1207920650, now seen corresponding path program 1 times [2025-01-10 00:57:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168746824] [2025-01-10 00:57:36,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:36,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:36,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:36,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:36,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:36,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168746824] [2025-01-10 00:57:36,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168746824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:36,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91084675] [2025-01-10 00:57:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:36,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:36,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:36,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:37,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 00:57:37,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 217 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:37,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:37,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 00:57:37,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:37,820 INFO L124 PetriNetUnfolderBase]: 442/894 cut-off events. [2025-01-10 00:57:37,820 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-01-10 00:57:37,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 894 events. 442/894 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4063 event pairs, 150 based on Foata normal form. 4/811 useless extension candidates. Maximal degree in co-relation 2258. Up to 467 conditions per place. [2025-01-10 00:57:37,824 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 86 selfloop transitions, 49 changer transitions 6/150 dead transitions. [2025-01-10 00:57:37,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 150 transitions, 817 flow [2025-01-10 00:57:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:57:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 00:57:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 665 transitions. [2025-01-10 00:57:37,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5215686274509804 [2025-01-10 00:57:37,826 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 217 flow. Second operand 17 states and 665 transitions. [2025-01-10 00:57:37,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 150 transitions, 817 flow [2025-01-10 00:57:37,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 150 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:37,833 INFO L231 Difference]: Finished difference. Result has 80 places, 97 transitions, 525 flow [2025-01-10 00:57:37,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=525, PETRI_PLACES=80, PETRI_TRANSITIONS=97} [2025-01-10 00:57:37,834 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2025-01-10 00:57:37,834 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 97 transitions, 525 flow [2025-01-10 00:57:37,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:37,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:37,835 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-01-10 00:57:37,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:57:37,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:37,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -856708270, now seen corresponding path program 2 times [2025-01-10 00:57:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:37,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336861680] [2025-01-10 00:57:37,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:57:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:37,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:37,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:37,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:57:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:38,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336861680] [2025-01-10 00:57:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336861680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:38,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:57:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467746216] [2025-01-10 00:57:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:57:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:38,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:57:38,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:57:38,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:38,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 97 transitions, 525 flow. Second operand has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:38,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:38,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:39,025 INFO L124 PetriNetUnfolderBase]: 378/801 cut-off events. [2025-01-10 00:57:39,025 INFO L125 PetriNetUnfolderBase]: For 809/818 co-relation queries the response was YES. [2025-01-10 00:57:39,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 801 events. 378/801 cut-off events. For 809/818 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3857 event pairs, 93 based on Foata normal form. 11/760 useless extension candidates. Maximal degree in co-relation 2403. Up to 381 conditions per place. [2025-01-10 00:57:39,029 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 72 selfloop transitions, 63 changer transitions 6/156 dead transitions. [2025-01-10 00:57:39,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 156 transitions, 1034 flow [2025-01-10 00:57:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:57:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 00:57:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 805 transitions. [2025-01-10 00:57:39,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5366666666666666 [2025-01-10 00:57:39,032 INFO L175 Difference]: Start difference. First operand has 80 places, 97 transitions, 525 flow. Second operand 20 states and 805 transitions. [2025-01-10 00:57:39,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 156 transitions, 1034 flow [2025-01-10 00:57:39,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 156 transitions, 987 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:39,039 INFO L231 Difference]: Finished difference. Result has 99 places, 114 transitions, 743 flow [2025-01-10 00:57:39,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=743, PETRI_PLACES=99, PETRI_TRANSITIONS=114} [2025-01-10 00:57:39,040 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 31 predicate places. [2025-01-10 00:57:39,041 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 114 transitions, 743 flow [2025-01-10 00:57:39,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:39,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:39,041 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-01-10 00:57:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:57:39,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:39,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash 551003502, now seen corresponding path program 3 times [2025-01-10 00:57:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:39,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815407308] [2025-01-10 00:57:39,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:57:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:39,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:39,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:39,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:57:39,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815407308] [2025-01-10 00:57:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815407308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807211788] [2025-01-10 00:57:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:39,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:39,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:39,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:39,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 00:57:39,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 114 transitions, 743 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:39,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:39,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 00:57:39,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:40,337 INFO L124 PetriNetUnfolderBase]: 502/1037 cut-off events. [2025-01-10 00:57:40,337 INFO L125 PetriNetUnfolderBase]: For 1617/1617 co-relation queries the response was YES. [2025-01-10 00:57:40,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 1037 events. 502/1037 cut-off events. For 1617/1617 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5036 event pairs, 173 based on Foata normal form. 15/989 useless extension candidates. Maximal degree in co-relation 3525. Up to 497 conditions per place. [2025-01-10 00:57:40,343 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 108 selfloop transitions, 66 changer transitions 12/195 dead transitions. [2025-01-10 00:57:40,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 195 transitions, 1532 flow [2025-01-10 00:57:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:57:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 00:57:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2025-01-10 00:57:40,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408333333333334 [2025-01-10 00:57:40,346 INFO L175 Difference]: Start difference. First operand has 99 places, 114 transitions, 743 flow. Second operand 16 states and 649 transitions. [2025-01-10 00:57:40,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 195 transitions, 1532 flow [2025-01-10 00:57:40,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 195 transitions, 1450 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 00:57:40,356 INFO L231 Difference]: Finished difference. Result has 111 places, 136 transitions, 1044 flow [2025-01-10 00:57:40,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1044, PETRI_PLACES=111, PETRI_TRANSITIONS=136} [2025-01-10 00:57:40,358 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2025-01-10 00:57:40,358 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 136 transitions, 1044 flow [2025-01-10 00:57:40,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:40,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:40,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-01-10 00:57:40,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:57:40,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:40,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:40,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2105282681, now seen corresponding path program 1 times [2025-01-10 00:57:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:40,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715399939] [2025-01-10 00:57:40,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:40,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:40,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:40,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:40,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715399939] [2025-01-10 00:57:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715399939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:40,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:57:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517190962] [2025-01-10 00:57:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:57:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:40,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:57:40,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:57:40,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 00:57:40,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 136 transitions, 1044 flow. Second operand has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:40,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:40,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 00:57:40,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:41,598 INFO L124 PetriNetUnfolderBase]: 804/1660 cut-off events. [2025-01-10 00:57:41,598 INFO L125 PetriNetUnfolderBase]: For 4026/4063 co-relation queries the response was YES. [2025-01-10 00:57:41,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6145 conditions, 1660 events. 804/1660 cut-off events. For 4026/4063 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9797 event pairs, 160 based on Foata normal form. 59/1618 useless extension candidates. Maximal degree in co-relation 6114. Up to 515 conditions per place. [2025-01-10 00:57:41,611 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 211 selfloop transitions, 128 changer transitions 12/363 dead transitions. [2025-01-10 00:57:41,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 363 transitions, 3184 flow [2025-01-10 00:57:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 00:57:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 00:57:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1047 transitions. [2025-01-10 00:57:41,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5584 [2025-01-10 00:57:41,614 INFO L175 Difference]: Start difference. First operand has 111 places, 136 transitions, 1044 flow. Second operand 25 states and 1047 transitions. [2025-01-10 00:57:41,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 363 transitions, 3184 flow [2025-01-10 00:57:41,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 363 transitions, 3057 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-01-10 00:57:41,632 INFO L231 Difference]: Finished difference. Result has 139 places, 215 transitions, 1961 flow [2025-01-10 00:57:41,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1961, PETRI_PLACES=139, PETRI_TRANSITIONS=215} [2025-01-10 00:57:41,632 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 71 predicate places. [2025-01-10 00:57:41,632 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 215 transitions, 1961 flow [2025-01-10 00:57:41,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:41,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:41,633 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-01-10 00:57:41,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:57:41,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:41,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2104575734, now seen corresponding path program 4 times [2025-01-10 00:57:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831997449] [2025-01-10 00:57:41,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:57:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:41,641 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-01-10 00:57:41,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-01-10 00:57:41,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:57:41,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:41,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:41,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831997449] [2025-01-10 00:57:41,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831997449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:41,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:57:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91979277] [2025-01-10 00:57:41,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:41,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:41,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:41,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:41,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-01-10 00:57:41,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 215 transitions, 1961 flow. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:41,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:41,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-01-10 00:57:41,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:42,180 INFO L124 PetriNetUnfolderBase]: 1178/2624 cut-off events. [2025-01-10 00:57:42,180 INFO L125 PetriNetUnfolderBase]: For 8078/8133 co-relation queries the response was YES. [2025-01-10 00:57:42,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10532 conditions, 2624 events. 1178/2624 cut-off events. For 8078/8133 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19251 event pairs, 162 based on Foata normal form. 78/2540 useless extension candidates. Maximal degree in co-relation 10490. Up to 654 conditions per place. [2025-01-10 00:57:42,202 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 229 selfloop transitions, 99 changer transitions 0/387 dead transitions. [2025-01-10 00:57:42,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 387 transitions, 3755 flow [2025-01-10 00:57:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:57:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:57:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 388 transitions. [2025-01-10 00:57:42,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7390476190476191 [2025-01-10 00:57:42,204 INFO L175 Difference]: Start difference. First operand has 139 places, 215 transitions, 1961 flow. Second operand 7 states and 388 transitions. [2025-01-10 00:57:42,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 387 transitions, 3755 flow [2025-01-10 00:57:42,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 387 transitions, 3705 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-01-10 00:57:42,245 INFO L231 Difference]: Finished difference. Result has 145 places, 256 transitions, 2547 flow [2025-01-10 00:57:42,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2547, PETRI_PLACES=145, PETRI_TRANSITIONS=256} [2025-01-10 00:57:42,246 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2025-01-10 00:57:42,246 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 256 transitions, 2547 flow [2025-01-10 00:57:42,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:42,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:42,246 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-01-10 00:57:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:57:42,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:42,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2137503684, now seen corresponding path program 5 times [2025-01-10 00:57:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510031762] [2025-01-10 00:57:42,247 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:57:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:42,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:42,263 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:42,263 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:57:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510031762] [2025-01-10 00:57:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510031762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045488606] [2025-01-10 00:57:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:42,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:42,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:42,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:42,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 00:57:42,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 256 transitions, 2547 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:42,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:42,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 00:57:42,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:43,565 INFO L124 PetriNetUnfolderBase]: 1558/3171 cut-off events. [2025-01-10 00:57:43,565 INFO L125 PetriNetUnfolderBase]: For 11939/11945 co-relation queries the response was YES. [2025-01-10 00:57:43,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14228 conditions, 3171 events. 1558/3171 cut-off events. For 11939/11945 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 21291 event pairs, 551 based on Foata normal form. 4/2994 useless extension candidates. Maximal degree in co-relation 14183. Up to 1966 conditions per place. [2025-01-10 00:57:43,589 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 155 selfloop transitions, 128 changer transitions 6/298 dead transitions. [2025-01-10 00:57:43,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 298 transitions, 3375 flow [2025-01-10 00:57:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:57:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 00:57:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 644 transitions. [2025-01-10 00:57:43,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5050980392156863 [2025-01-10 00:57:43,591 INFO L175 Difference]: Start difference. First operand has 145 places, 256 transitions, 2547 flow. Second operand 17 states and 644 transitions. [2025-01-10 00:57:43,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 298 transitions, 3375 flow [2025-01-10 00:57:43,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 298 transitions, 3311 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-01-10 00:57:43,632 INFO L231 Difference]: Finished difference. Result has 162 places, 258 transitions, 2792 flow [2025-01-10 00:57:43,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2792, PETRI_PLACES=162, PETRI_TRANSITIONS=258} [2025-01-10 00:57:43,633 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 94 predicate places. [2025-01-10 00:57:43,633 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 258 transitions, 2792 flow [2025-01-10 00:57:43,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:43,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:43,634 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-01-10 00:57:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:57:43,634 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:43,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash -71267694, now seen corresponding path program 6 times [2025-01-10 00:57:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843263544] [2025-01-10 00:57:43,635 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:57:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:43,641 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:43,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:43,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 00:57:43,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843263544] [2025-01-10 00:57:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843263544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:43,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:43,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:57:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137720827] [2025-01-10 00:57:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:57:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:43,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:57:43,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:57:44,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:44,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 258 transitions, 2792 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-01-10 00:57:44,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:44,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:44,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:44,484 INFO L124 PetriNetUnfolderBase]: 1289/2713 cut-off events. [2025-01-10 00:57:44,484 INFO L125 PetriNetUnfolderBase]: For 10287/10347 co-relation queries the response was YES. [2025-01-10 00:57:44,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12290 conditions, 2713 events. 1289/2713 cut-off events. For 10287/10347 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19053 event pairs, 403 based on Foata normal form. 44/2554 useless extension candidates. Maximal degree in co-relation 12242. Up to 1618 conditions per place. [2025-01-10 00:57:44,498 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 130 selfloop transitions, 103 changer transitions 6/258 dead transitions. [2025-01-10 00:57:44,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 258 transitions, 3022 flow [2025-01-10 00:57:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:57:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 00:57:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 576 transitions. [2025-01-10 00:57:44,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-01-10 00:57:44,500 INFO L175 Difference]: Start difference. First operand has 162 places, 258 transitions, 2792 flow. Second operand 14 states and 576 transitions. [2025-01-10 00:57:44,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 258 transitions, 3022 flow [2025-01-10 00:57:44,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 258 transitions, 2830 flow, removed 33 selfloop flow, removed 12 redundant places. [2025-01-10 00:57:44,535 INFO L231 Difference]: Finished difference. Result has 159 places, 228 transitions, 2443 flow [2025-01-10 00:57:44,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2443, PETRI_PLACES=159, PETRI_TRANSITIONS=228} [2025-01-10 00:57:44,536 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 91 predicate places. [2025-01-10 00:57:44,536 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 228 transitions, 2443 flow [2025-01-10 00:57:44,536 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-01-10 00:57:44,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:44,536 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-01-10 00:57:44,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:57:44,537 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1669170304, now seen corresponding path program 7 times [2025-01-10 00:57:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251719682] [2025-01-10 00:57:44,537 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:57:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:44,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:44,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:44,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:44,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251719682] [2025-01-10 00:57:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251719682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:57:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231407717] [2025-01-10 00:57:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:57:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:44,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:57:44,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:57:44,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:44,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 228 transitions, 2443 flow. Second operand has 10 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:44,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:44,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:44,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:45,883 INFO L124 PetriNetUnfolderBase]: 2174/4532 cut-off events. [2025-01-10 00:57:45,883 INFO L125 PetriNetUnfolderBase]: For 16796/16859 co-relation queries the response was YES. [2025-01-10 00:57:45,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19613 conditions, 4532 events. 2174/4532 cut-off events. For 16796/16859 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 30406 event pairs, 408 based on Foata normal form. 94/4298 useless extension candidates. Maximal degree in co-relation 19567. Up to 1399 conditions per place. [2025-01-10 00:57:45,909 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 347 selfloop transitions, 157 changer transitions 16/540 dead transitions. [2025-01-10 00:57:45,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 540 transitions, 5686 flow [2025-01-10 00:57:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:57:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 00:57:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 954 transitions. [2025-01-10 00:57:45,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636 [2025-01-10 00:57:45,913 INFO L175 Difference]: Start difference. First operand has 159 places, 228 transitions, 2443 flow. Second operand 20 states and 954 transitions. [2025-01-10 00:57:45,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 540 transitions, 5686 flow [2025-01-10 00:57:45,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 540 transitions, 5432 flow, removed 13 selfloop flow, removed 15 redundant places. [2025-01-10 00:57:45,963 INFO L231 Difference]: Finished difference. Result has 174 places, 296 transitions, 3316 flow [2025-01-10 00:57:45,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3316, PETRI_PLACES=174, PETRI_TRANSITIONS=296} [2025-01-10 00:57:45,963 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 106 predicate places. [2025-01-10 00:57:45,963 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 296 transitions, 3316 flow [2025-01-10 00:57:45,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:45,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:45,964 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-01-10 00:57:45,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:57:45,964 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:45,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2132861270, now seen corresponding path program 8 times [2025-01-10 00:57:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193176968] [2025-01-10 00:57:45,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:57:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:45,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:45,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:45,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:57:45,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193176968] [2025-01-10 00:57:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193176968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730703316] [2025-01-10 00:57:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:46,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:46,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:46,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:46,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 00:57:46,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 296 transitions, 3316 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:46,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:46,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 00:57:46,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:47,347 INFO L124 PetriNetUnfolderBase]: 2366/4761 cut-off events. [2025-01-10 00:57:47,347 INFO L125 PetriNetUnfolderBase]: For 27405/27420 co-relation queries the response was YES. [2025-01-10 00:57:47,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24461 conditions, 4761 events. 2366/4761 cut-off events. For 27405/27420 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 30446 event pairs, 986 based on Foata normal form. 9/4470 useless extension candidates. Maximal degree in co-relation 24403. Up to 3638 conditions per place. [2025-01-10 00:57:47,380 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 255 selfloop transitions, 56 changer transitions 44/364 dead transitions. [2025-01-10 00:57:47,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 364 transitions, 4560 flow [2025-01-10 00:57:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:57:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:57:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 535 transitions. [2025-01-10 00:57:47,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2025-01-10 00:57:47,382 INFO L175 Difference]: Start difference. First operand has 174 places, 296 transitions, 3316 flow. Second operand 13 states and 535 transitions. [2025-01-10 00:57:47,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 364 transitions, 4560 flow [2025-01-10 00:57:47,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 364 transitions, 4376 flow, removed 91 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:47,541 INFO L231 Difference]: Finished difference. Result has 190 places, 294 transitions, 3305 flow [2025-01-10 00:57:47,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3174, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3305, PETRI_PLACES=190, PETRI_TRANSITIONS=294} [2025-01-10 00:57:47,543 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 122 predicate places. [2025-01-10 00:57:47,543 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 294 transitions, 3305 flow [2025-01-10 00:57:47,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:47,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:47,544 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-01-10 00:57:47,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:57:47,544 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:47,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -123367790, now seen corresponding path program 9 times [2025-01-10 00:57:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:47,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659098720] [2025-01-10 00:57:47,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:57:47,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:47,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:57:47,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:57:47,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:57:47,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:47,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659098720] [2025-01-10 00:57:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659098720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:57:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163570509] [2025-01-10 00:57:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:47,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:57:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:57:47,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:57:48,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:48,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 294 transitions, 3305 flow. Second operand has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:48,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:48,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:48,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:48,630 INFO L124 PetriNetUnfolderBase]: 1867/3878 cut-off events. [2025-01-10 00:57:48,630 INFO L125 PetriNetUnfolderBase]: For 23102/23199 co-relation queries the response was YES. [2025-01-10 00:57:48,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19624 conditions, 3878 events. 1867/3878 cut-off events. For 23102/23199 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 25656 event pairs, 734 based on Foata normal form. 68/3630 useless extension candidates. Maximal degree in co-relation 19566. Up to 2930 conditions per place. [2025-01-10 00:57:48,655 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 200 selfloop transitions, 31 changer transitions 10/264 dead transitions. [2025-01-10 00:57:48,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 264 transitions, 3185 flow [2025-01-10 00:57:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:57:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:57:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 457 transitions. [2025-01-10 00:57:48,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553939393939394 [2025-01-10 00:57:48,656 INFO L175 Difference]: Start difference. First operand has 190 places, 294 transitions, 3305 flow. Second operand 11 states and 457 transitions. [2025-01-10 00:57:48,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 264 transitions, 3185 flow [2025-01-10 00:57:48,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 264 transitions, 3086 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-01-10 00:57:48,708 INFO L231 Difference]: Finished difference. Result has 174 places, 241 transitions, 2562 flow [2025-01-10 00:57:48,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2562, PETRI_PLACES=174, PETRI_TRANSITIONS=241} [2025-01-10 00:57:48,709 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 106 predicate places. [2025-01-10 00:57:48,709 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 241 transitions, 2562 flow [2025-01-10 00:57:48,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:48,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:48,709 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-01-10 00:57:48,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:57:48,709 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1887216978, now seen corresponding path program 1 times [2025-01-10 00:57:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:48,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484410007] [2025-01-10 00:57:48,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:48,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:57:48,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:57:48,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:48,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:48,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484410007] [2025-01-10 00:57:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484410007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956368192] [2025-01-10 00:57:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:48,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:48,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:49,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 00:57:49,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 241 transitions, 2562 flow. Second operand has 11 states, 11 states have (on average 34.45454545454545) internal successors, (379), 11 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:49,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:49,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 00:57:49,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:49,968 INFO L124 PetriNetUnfolderBase]: 2441/5024 cut-off events. [2025-01-10 00:57:49,968 INFO L125 PetriNetUnfolderBase]: For 27558/27644 co-relation queries the response was YES. [2025-01-10 00:57:49,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24873 conditions, 5024 events. 2441/5024 cut-off events. For 27558/27644 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 34812 event pairs, 868 based on Foata normal form. 82/4732 useless extension candidates. Maximal degree in co-relation 24819. Up to 3172 conditions per place. [2025-01-10 00:57:50,001 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 293 selfloop transitions, 94 changer transitions 2/404 dead transitions. [2025-01-10 00:57:50,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 404 transitions, 4830 flow [2025-01-10 00:57:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:57:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 00:57:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 728 transitions. [2025-01-10 00:57:50,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709803921568627 [2025-01-10 00:57:50,003 INFO L175 Difference]: Start difference. First operand has 174 places, 241 transitions, 2562 flow. Second operand 17 states and 728 transitions. [2025-01-10 00:57:50,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 404 transitions, 4830 flow [2025-01-10 00:57:50,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 404 transitions, 4609 flow, removed 28 selfloop flow, removed 16 redundant places. [2025-01-10 00:57:50,125 INFO L231 Difference]: Finished difference. Result has 181 places, 288 transitions, 3356 flow [2025-01-10 00:57:50,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3356, PETRI_PLACES=181, PETRI_TRANSITIONS=288} [2025-01-10 00:57:50,126 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 113 predicate places. [2025-01-10 00:57:50,126 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 288 transitions, 3356 flow [2025-01-10 00:57:50,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.45454545454545) internal successors, (379), 11 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:50,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:50,126 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-01-10 00:57:50,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:57:50,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:50,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1539903968, now seen corresponding path program 2 times [2025-01-10 00:57:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194395005] [2025-01-10 00:57:50,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:57:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:50,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:57:50,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:57:50,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:57:50,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194395005] [2025-01-10 00:57:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194395005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:57:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131469993] [2025-01-10 00:57:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:50,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:50,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:50,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 00:57:50,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 288 transitions, 3356 flow. Second operand has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:50,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:50,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 00:57:50,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:51,124 INFO L124 PetriNetUnfolderBase]: 2679/5394 cut-off events. [2025-01-10 00:57:51,124 INFO L125 PetriNetUnfolderBase]: For 34774/34794 co-relation queries the response was YES. [2025-01-10 00:57:51,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28592 conditions, 5394 events. 2679/5394 cut-off events. For 34774/34794 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 36754 event pairs, 367 based on Foata normal form. 120/5002 useless extension candidates. Maximal degree in co-relation 28534. Up to 2185 conditions per place. [2025-01-10 00:57:51,167 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 379 selfloop transitions, 103 changer transitions 0/500 dead transitions. [2025-01-10 00:57:51,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 500 transitions, 6752 flow [2025-01-10 00:57:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:57:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:57:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 319 transitions. [2025-01-10 00:57:51,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076190476190476 [2025-01-10 00:57:51,168 INFO L175 Difference]: Start difference. First operand has 181 places, 288 transitions, 3356 flow. Second operand 7 states and 319 transitions. [2025-01-10 00:57:51,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 500 transitions, 6752 flow [2025-01-10 00:57:51,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 500 transitions, 6482 flow, removed 123 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:51,283 INFO L231 Difference]: Finished difference. Result has 188 places, 330 transitions, 4109 flow [2025-01-10 00:57:51,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3220, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4109, PETRI_PLACES=188, PETRI_TRANSITIONS=330} [2025-01-10 00:57:51,283 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 120 predicate places. [2025-01-10 00:57:51,284 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 330 transitions, 4109 flow [2025-01-10 00:57:51,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:51,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:51,284 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-01-10 00:57:51,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:57:51,284 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:51,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1272949587, now seen corresponding path program 1 times [2025-01-10 00:57:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:51,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744670174] [2025-01-10 00:57:51,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:57:51,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:57:51,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:51,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744670174] [2025-01-10 00:57:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744670174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248900080] [2025-01-10 00:57:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:51,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:51,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:51,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:51,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:51,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 330 transitions, 4109 flow. Second operand has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:51,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:51,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:51,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:53,242 INFO L124 PetriNetUnfolderBase]: 4423/8983 cut-off events. [2025-01-10 00:57:53,242 INFO L125 PetriNetUnfolderBase]: For 77863/77993 co-relation queries the response was YES. [2025-01-10 00:57:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51811 conditions, 8983 events. 4423/8983 cut-off events. For 77863/77993 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 69045 event pairs, 566 based on Foata normal form. 170/8490 useless extension candidates. Maximal degree in co-relation 51748. Up to 2125 conditions per place. [2025-01-10 00:57:53,302 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 482 selfloop transitions, 407 changer transitions 2/914 dead transitions. [2025-01-10 00:57:53,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 914 transitions, 13109 flow [2025-01-10 00:57:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:57:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 00:57:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 909 transitions. [2025-01-10 00:57:53,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.606 [2025-01-10 00:57:53,304 INFO L175 Difference]: Start difference. First operand has 188 places, 330 transitions, 4109 flow. Second operand 20 states and 909 transitions. [2025-01-10 00:57:53,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 914 transitions, 13109 flow [2025-01-10 00:57:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 914 transitions, 12915 flow, removed 96 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:53,543 INFO L231 Difference]: Finished difference. Result has 220 places, 604 transitions, 9406 flow [2025-01-10 00:57:53,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=4026, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9406, PETRI_PLACES=220, PETRI_TRANSITIONS=604} [2025-01-10 00:57:53,544 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 152 predicate places. [2025-01-10 00:57:53,544 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 604 transitions, 9406 flow [2025-01-10 00:57:53,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:53,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:53,544 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-01-10 00:57:53,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:57:53,544 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:53,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1412381465, now seen corresponding path program 2 times [2025-01-10 00:57:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548812357] [2025-01-10 00:57:53,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:57:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:53,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:57:53,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:57:53,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:57:53,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:53,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548812357] [2025-01-10 00:57:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548812357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692977703] [2025-01-10 00:57:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:53,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:53,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:53,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 604 transitions, 9406 flow. Second operand has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:53,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:53,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:53,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:56,394 INFO L124 PetriNetUnfolderBase]: 5394/10914 cut-off events. [2025-01-10 00:57:56,394 INFO L125 PetriNetUnfolderBase]: For 134510/134717 co-relation queries the response was YES. [2025-01-10 00:57:56,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72298 conditions, 10914 events. 5394/10914 cut-off events. For 134510/134717 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 87605 event pairs, 654 based on Foata normal form. 130/10223 useless extension candidates. Maximal degree in co-relation 72220. Up to 2651 conditions per place. [2025-01-10 00:57:56,510 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 553 selfloop transitions, 499 changer transitions 0/1073 dead transitions. [2025-01-10 00:57:56,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1073 transitions, 17952 flow [2025-01-10 00:57:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:57:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 00:57:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 962 transitions. [2025-01-10 00:57:56,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6413333333333333 [2025-01-10 00:57:56,512 INFO L175 Difference]: Start difference. First operand has 220 places, 604 transitions, 9406 flow. Second operand 20 states and 962 transitions. [2025-01-10 00:57:56,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1073 transitions, 17952 flow [2025-01-10 00:57:57,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1073 transitions, 17490 flow, removed 227 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:57,166 INFO L231 Difference]: Finished difference. Result has 249 places, 762 transitions, 13220 flow [2025-01-10 00:57:57,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=9044, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=13220, PETRI_PLACES=249, PETRI_TRANSITIONS=762} [2025-01-10 00:57:57,167 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 181 predicate places. [2025-01-10 00:57:57,167 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 762 transitions, 13220 flow [2025-01-10 00:57:57,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:57,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:57,168 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-01-10 00:57:57,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:57:57,168 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:57:57,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1950269361, now seen corresponding path program 3 times [2025-01-10 00:57:57,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:57,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644577570] [2025-01-10 00:57:57,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:57:57,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:57,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:57:57,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:57:57,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:57:57,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644577570] [2025-01-10 00:57:57,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644577570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:57,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:57,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:57:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599264603] [2025-01-10 00:57:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:57,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:57:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:57,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:57:57,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:57:57,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:57,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 762 transitions, 13220 flow. Second operand has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:57,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:57,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:57,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:00,877 INFO L124 PetriNetUnfolderBase]: 6724/13603 cut-off events. [2025-01-10 00:58:00,877 INFO L125 PetriNetUnfolderBase]: For 210860/211103 co-relation queries the response was YES. [2025-01-10 00:58:00,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96226 conditions, 13603 events. 6724/13603 cut-off events. For 210860/211103 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 114515 event pairs, 1933 based on Foata normal form. 53/12604 useless extension candidates. Maximal degree in co-relation 96136. Up to 9670 conditions per place. [2025-01-10 00:58:01,062 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 892 selfloop transitions, 253 changer transitions 0/1165 dead transitions. [2025-01-10 00:58:01,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1165 transitions, 21554 flow [2025-01-10 00:58:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 00:58:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 00:58:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 857 transitions. [2025-01-10 00:58:01,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6014035087719298 [2025-01-10 00:58:01,064 INFO L175 Difference]: Start difference. First operand has 249 places, 762 transitions, 13220 flow. Second operand 19 states and 857 transitions. [2025-01-10 00:58:01,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1165 transitions, 21554 flow [2025-01-10 00:58:02,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1165 transitions, 20734 flow, removed 409 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:02,122 INFO L231 Difference]: Finished difference. Result has 280 places, 974 transitions, 17573 flow [2025-01-10 00:58:02,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=12406, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17573, PETRI_PLACES=280, PETRI_TRANSITIONS=974} [2025-01-10 00:58:02,123 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 212 predicate places. [2025-01-10 00:58:02,123 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 974 transitions, 17573 flow [2025-01-10 00:58:02,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:02,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:02,125 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-01-10 00:58:02,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:58:02,126 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:58:02,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash 205639107, now seen corresponding path program 1 times [2025-01-10 00:58:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894247717] [2025-01-10 00:58:02,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:02,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:58:02,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:58:02,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:02,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894247717] [2025-01-10 00:58:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894247717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:58:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130472171] [2025-01-10 00:58:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:58:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:02,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:58:02,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:58:02,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 00:58:02,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 974 transitions, 17573 flow. Second operand has 15 states, 15 states have (on average 34.53333333333333) internal successors, (518), 15 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:02,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:02,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 00:58:02,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:08,890 INFO L124 PetriNetUnfolderBase]: 9590/19287 cut-off events. [2025-01-10 00:58:08,891 INFO L125 PetriNetUnfolderBase]: For 330189/330664 co-relation queries the response was YES. [2025-01-10 00:58:08,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142716 conditions, 19287 events. 9590/19287 cut-off events. For 330189/330664 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 166944 event pairs, 1873 based on Foata normal form. 187/17963 useless extension candidates. Maximal degree in co-relation 142611. Up to 7936 conditions per place. [2025-01-10 00:58:09,072 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 950 selfloop transitions, 792 changer transitions 0/1784 dead transitions. [2025-01-10 00:58:09,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1784 transitions, 35731 flow [2025-01-10 00:58:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 00:58:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 00:58:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1011 transitions. [2025-01-10 00:58:09,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860869565217391 [2025-01-10 00:58:09,074 INFO L175 Difference]: Start difference. First operand has 280 places, 974 transitions, 17573 flow. Second operand 23 states and 1011 transitions. [2025-01-10 00:58:09,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1784 transitions, 35731 flow [2025-01-10 00:58:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 1784 transitions, 33668 flow, removed 1019 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:10,799 INFO L231 Difference]: Finished difference. Result has 318 places, 1490 transitions, 30264 flow [2025-01-10 00:58:10,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=16606, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=30264, PETRI_PLACES=318, PETRI_TRANSITIONS=1490} [2025-01-10 00:58:10,800 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 250 predicate places. [2025-01-10 00:58:10,800 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 1490 transitions, 30264 flow [2025-01-10 00:58:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 34.53333333333333) internal successors, (518), 15 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:10,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:10,801 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-01-10 00:58:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:58:10,801 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:58:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2094027078, now seen corresponding path program 1 times [2025-01-10 00:58:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631634391] [2025-01-10 00:58:10,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:10,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:58:10,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:58:10,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:11,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631634391] [2025-01-10 00:58:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631634391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:11,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:58:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99941198] [2025-01-10 00:58:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:11,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:58:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:11,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:58:11,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:58:11,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:58:11,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 1490 transitions, 30264 flow. Second operand has 15 states, 15 states have (on average 35.6) internal successors, (534), 15 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:11,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:11,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:58:11,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:19,626 INFO L124 PetriNetUnfolderBase]: 10518/21099 cut-off events. [2025-01-10 00:58:19,626 INFO L125 PetriNetUnfolderBase]: For 400521/400779 co-relation queries the response was YES. [2025-01-10 00:58:19,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166067 conditions, 21099 events. 10518/21099 cut-off events. For 400521/400779 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 184209 event pairs, 2231 based on Foata normal form. 69/19603 useless extension candidates. Maximal degree in co-relation 165945. Up to 8679 conditions per place. [2025-01-10 00:58:19,978 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 1045 selfloop transitions, 962 changer transitions 0/2043 dead transitions. [2025-01-10 00:58:19,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 2043 transitions, 42865 flow [2025-01-10 00:58:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 00:58:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 00:58:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1057 transitions. [2025-01-10 00:58:19,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127536231884058 [2025-01-10 00:58:19,979 INFO L175 Difference]: Start difference. First operand has 318 places, 1490 transitions, 30264 flow. Second operand 23 states and 1057 transitions. [2025-01-10 00:58:19,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 2043 transitions, 42865 flow [2025-01-10 00:58:23,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 2043 transitions, 41787 flow, removed 538 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:23,739 INFO L231 Difference]: Finished difference. Result has 348 places, 1717 transitions, 36694 flow [2025-01-10 00:58:23,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=29222, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=730, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=36694, PETRI_PLACES=348, PETRI_TRANSITIONS=1717} [2025-01-10 00:58:23,741 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 280 predicate places. [2025-01-10 00:58:23,741 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 1717 transitions, 36694 flow [2025-01-10 00:58:23,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.6) internal successors, (534), 15 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:23,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:23,742 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-01-10 00:58:23,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:58:23,742 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:58:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1701619531, now seen corresponding path program 2 times [2025-01-10 00:58:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625579102] [2025-01-10 00:58:23,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:58:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:23,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:58:23,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:58:23,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:58:23,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625579102] [2025-01-10 00:58:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625579102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:58:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798031864] [2025-01-10 00:58:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:58:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:23,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:58:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:58:24,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-01-10 00:58:24,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 1717 transitions, 36694 flow. Second operand has 11 states, 11 states have (on average 34.18181818181818) internal successors, (376), 11 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:24,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:24,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-01-10 00:58:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:39,534 INFO L124 PetriNetUnfolderBase]: 17396/34307 cut-off events. [2025-01-10 00:58:39,534 INFO L125 PetriNetUnfolderBase]: For 701738/701866 co-relation queries the response was YES. [2025-01-10 00:58:40,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281183 conditions, 34307 events. 17396/34307 cut-off events. For 701738/701866 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 318866 event pairs, 1650 based on Foata normal form. 181/32083 useless extension candidates. Maximal degree in co-relation 281051. Up to 6941 conditions per place. [2025-01-10 00:58:40,255 INFO L140 encePairwiseOnDemand]: 54/75 looper letters, 1147 selfloop transitions, 2206 changer transitions 0/3363 dead transitions. [2025-01-10 00:58:40,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 3363 transitions, 76305 flow [2025-01-10 00:58:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 00:58:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 00:58:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1124 transitions. [2025-01-10 00:58:40,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5764102564102564 [2025-01-10 00:58:40,256 INFO L175 Difference]: Start difference. First operand has 348 places, 1717 transitions, 36694 flow. Second operand 26 states and 1124 transitions. [2025-01-10 00:58:40,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 3363 transitions, 76305 flow [2025-01-10 00:58:50,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 3363 transitions, 73786 flow, removed 844 selfloop flow, removed 7 redundant places. [2025-01-10 00:58:50,154 INFO L231 Difference]: Finished difference. Result has 388 places, 2986 transitions, 70368 flow [2025-01-10 00:58:50,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=35291, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1080, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=70368, PETRI_PLACES=388, PETRI_TRANSITIONS=2986} [2025-01-10 00:58:50,156 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 320 predicate places. [2025-01-10 00:58:50,156 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 2986 transitions, 70368 flow [2025-01-10 00:58:50,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.18181818181818) internal successors, (376), 11 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:50,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:50,157 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-01-10 00:58:50,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 00:58:50,157 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-01-10 00:58:50,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1516864575, now seen corresponding path program 3 times [2025-01-10 00:58:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996087767] [2025-01-10 00:58:50,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:58:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:50,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:58:50,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:58:50,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:58:50,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996087767] [2025-01-10 00:58:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996087767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:58:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272665931] [2025-01-10 00:58:50,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:50,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:58:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:58:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:58:50,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 00:58:50,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 2986 transitions, 70368 flow. Second operand has 15 states, 15 states have (on average 34.53333333333333) internal successors, (518), 15 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:50,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:50,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 00:58:50,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand