./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:01,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:01,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:01,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:01,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:01,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:01,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:01,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:01,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:01,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:01,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:01,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:01,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:01,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:01,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:01,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:01,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:01,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:01,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:01,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:01,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:01,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:01,549 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2025-03-04 10:18:01,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:01,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:01,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:01,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:01,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:01,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-03-04 10:18:02,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c3ef843/aed2a187fe2b4ca2865772b0a3a82f2f/FLAGa236c7095 [2025-03-04 10:18:03,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:03,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-03-04 10:18:03,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c3ef843/aed2a187fe2b4ca2865772b0a3a82f2f/FLAGa236c7095 [2025-03-04 10:18:03,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c3ef843/aed2a187fe2b4ca2865772b0a3a82f2f [2025-03-04 10:18:03,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:03,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:03,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:03,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:03,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:03,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a48582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03, skipping insertion in model container [2025-03-04 10:18:03,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:03,394 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:18:03,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:03,406 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:03,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:03,450 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:03,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03 WrapperNode [2025-03-04 10:18:03,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:03,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:03,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:03,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:03,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,487 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 169 [2025-03-04 10:18:03,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:03,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:03,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:03,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:03,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,518 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:18:03,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:03,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:03,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:03,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:03,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (1/1) ... [2025-03-04 10:18:03,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:03,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:03,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:18:03,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:18:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:18:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:18:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:18:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:18:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:18:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:18:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:03,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:18:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:18:03,598 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:18:03,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:03,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:04,022 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:04,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:04,251 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:04,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:04,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:04 BoogieIcfgContainer [2025-03-04 10:18:04,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:04,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:04,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:04,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:04,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:03" (1/3) ... [2025-03-04 10:18:04,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a789bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:04, skipping insertion in model container [2025-03-04 10:18:04,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:03" (2/3) ... [2025-03-04 10:18:04,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a789bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:04, skipping insertion in model container [2025-03-04 10:18:04,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:04" (3/3) ... [2025-03-04 10:18:04,259 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2025-03-04 10:18:04,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:04,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-4.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-03-04 10:18:04,282 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:04,338 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:04,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 126 flow [2025-03-04 10:18:04,397 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-03-04 10:18:04,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:04,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 54 events. 6/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-04 10:18:04,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 56 transitions, 126 flow [2025-03-04 10:18:04,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 53 transitions, 118 flow [2025-03-04 10:18:04,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:04,427 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;@21ebcb4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:04,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 10:18:04,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:04,433 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:18:04,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:18:04,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:04,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:18:04,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:04,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 513415, now seen corresponding path program 1 times [2025-03-04 10:18:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845175553] [2025-03-04 10:18:04,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:04,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:18:04,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:18:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:04,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845175553] [2025-03-04 10:18:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845175553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554149972] [2025-03-04 10:18:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:04,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:04,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:04,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-04 10:18:04,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:04,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:04,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-04 10:18:04,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:04,832 INFO L124 PetriNetUnfolderBase]: 192/424 cut-off events. [2025-03-04 10:18:04,832 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:18:04,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 424 events. 192/424 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2208 event pairs, 120 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 652. Up to 298 conditions per place. [2025-03-04 10:18:04,838 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-03-04 10:18:04,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 168 flow [2025-03-04 10:18:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 10:18:04,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 10:18:04,851 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 118 flow. Second operand 3 states and 105 transitions. [2025-03-04 10:18:04,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 168 flow [2025-03-04 10:18:04,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:04,859 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 108 flow [2025-03-04 10:18:04,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2025-03-04 10:18:04,864 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2025-03-04 10:18:04,865 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 108 flow [2025-03-04 10:18:04,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:04,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:04,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:18:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:04,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:04,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 513416, now seen corresponding path program 1 times [2025-03-04 10:18:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:04,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600067484] [2025-03-04 10:18:04,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:18:04,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:18:04,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:04,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:05,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600067484] [2025-03-04 10:18:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600067484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:05,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665622620] [2025-03-04 10:18:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:05,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:05,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:05,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-04 10:18:05,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:05,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:05,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-04 10:18:05,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:05,303 INFO L124 PetriNetUnfolderBase]: 193/427 cut-off events. [2025-03-04 10:18:05,304 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:18:05,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 427 events. 193/427 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2219 event pairs, 120 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 720. Up to 303 conditions per place. [2025-03-04 10:18:05,306 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-03-04 10:18:05,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 180 flow [2025-03-04 10:18:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-04 10:18:05,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 10:18:05,310 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 108 flow. Second operand 3 states and 108 transitions. [2025-03-04 10:18:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 180 flow [2025-03-04 10:18:05,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:05,313 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 123 flow [2025-03-04 10:18:05,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2025-03-04 10:18:05,314 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-03-04 10:18:05,314 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 123 flow [2025-03-04 10:18:05,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:05,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:05,314 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:18:05,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:05,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 493408394, now seen corresponding path program 1 times [2025-03-04 10:18:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865754248] [2025-03-04 10:18:05,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:05,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:05,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:05,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:05,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865754248] [2025-03-04 10:18:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865754248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166289134] [2025-03-04 10:18:05,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:05,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:05,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:05,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:05,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:05,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:05,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:05,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:18:05,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:05,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:18:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:05,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166289134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:05,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531706792] [2025-03-04 10:18:05,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:05,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:05,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:05,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:06,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-04 10:18:06,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 123 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:06,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-04 10:18:06,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:06,323 INFO L124 PetriNetUnfolderBase]: 193/426 cut-off events. [2025-03-04 10:18:06,323 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:18:06,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 426 events. 193/426 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2229 event pairs, 120 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 720. Up to 299 conditions per place. [2025-03-04 10:18:06,327 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 25 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2025-03-04 10:18:06,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 183 flow [2025-03-04 10:18:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-04 10:18:06,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5607142857142857 [2025-03-04 10:18:06,329 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 123 flow. Second operand 5 states and 157 transitions. [2025-03-04 10:18:06,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 183 flow [2025-03-04 10:18:06,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:06,332 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 136 flow [2025-03-04 10:18:06,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-04 10:18:06,332 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-04 10:18:06,332 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 136 flow [2025-03-04 10:18:06,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:06,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:06,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:06,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:06,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:06,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1881596802, now seen corresponding path program 1 times [2025-03-04 10:18:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:06,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715880012] [2025-03-04 10:18:06,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:06,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:06,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:06,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:06,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715880012] [2025-03-04 10:18:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715880012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:06,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:06,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808811297] [2025-03-04 10:18:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:06,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:06,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:06,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:06,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:06,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-03-04 10:18:06,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:06,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-03-04 10:18:06,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:06,694 INFO L124 PetriNetUnfolderBase]: 193/378 cut-off events. [2025-03-04 10:18:06,694 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:18:06,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 378 events. 193/378 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1662 event pairs, 120 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 680. Up to 298 conditions per place. [2025-03-04 10:18:06,697 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 28 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 10:18:06,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 182 flow [2025-03-04 10:18:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-04 10:18:06,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 10:18:06,699 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 136 flow. Second operand 4 states and 104 transitions. [2025-03-04 10:18:06,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 182 flow [2025-03-04 10:18:06,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 169 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:06,700 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 113 flow [2025-03-04 10:18:06,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 10:18:06,701 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-04 10:18:06,701 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 113 flow [2025-03-04 10:18:06,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:06,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:06,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:06,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:06,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1881596801, now seen corresponding path program 1 times [2025-03-04 10:18:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:06,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324042042] [2025-03-04 10:18:06,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:06,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:06,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:06,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:06,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:06,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324042042] [2025-03-04 10:18:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324042042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344876879] [2025-03-04 10:18:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:06,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:06,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:06,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:06,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-03-04 10:18:06,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:06,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-03-04 10:18:06,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:06,831 INFO L124 PetriNetUnfolderBase]: 192/377 cut-off events. [2025-03-04 10:18:06,831 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:18:06,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 377 events. 192/377 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1671 event pairs, 120 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 672. Up to 301 conditions per place. [2025-03-04 10:18:06,833 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-04 10:18:06,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 168 flow [2025-03-04 10:18:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-04 10:18:06,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-03-04 10:18:06,834 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 113 flow. Second operand 3 states and 109 transitions. [2025-03-04 10:18:06,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 168 flow [2025-03-04 10:18:06,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:06,835 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 109 flow [2025-03-04 10:18:06,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-04 10:18:06,835 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-04 10:18:06,835 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 109 flow [2025-03-04 10:18:06,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:06,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:06,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:06,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:06,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1754475069, now seen corresponding path program 1 times [2025-03-04 10:18:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:06,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822510952] [2025-03-04 10:18:06,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:06,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:06,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:06,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:06,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822510952] [2025-03-04 10:18:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822510952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792251290] [2025-03-04 10:18:06,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:06,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:06,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:06,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:06,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:07,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:07,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:07,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:07,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:18:07,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:07,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:07,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792251290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:07,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940333855] [2025-03-04 10:18:07,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:07,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:07,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:07,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:07,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-04 10:18:07,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:07,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:07,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-04 10:18:07,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:07,630 INFO L124 PetriNetUnfolderBase]: 404/715 cut-off events. [2025-03-04 10:18:07,630 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:18:07,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 715 events. 404/715 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3576 event pairs, 129 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 1356. Up to 357 conditions per place. [2025-03-04 10:18:07,634 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 49 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-03-04 10:18:07,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 262 flow [2025-03-04 10:18:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-03-04 10:18:07,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6392857142857142 [2025-03-04 10:18:07,635 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 109 flow. Second operand 5 states and 179 transitions. [2025-03-04 10:18:07,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 262 flow [2025-03-04 10:18:07,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:07,636 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 121 flow [2025-03-04 10:18:07,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-03-04 10:18:07,637 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-03-04 10:18:07,637 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 121 flow [2025-03-04 10:18:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:07,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:07,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:07,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:07,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:18:07,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:07,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1871588736, now seen corresponding path program 1 times [2025-03-04 10:18:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385022927] [2025-03-04 10:18:07,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:07,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:07,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:07,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:07,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:07,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385022927] [2025-03-04 10:18:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385022927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481036353] [2025-03-04 10:18:07,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:07,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:07,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:07,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:18:08,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:08,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:08,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:18:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:08,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481036353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:08,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:08,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:18:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457411138] [2025-03-04 10:18:08,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:08,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:08,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:08,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:08,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-04 10:18:08,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 121 flow. Second operand has 17 states, 17 states have (on average 26.764705882352942) internal successors, (455), 17 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:08,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-04 10:18:08,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,245 INFO L124 PetriNetUnfolderBase]: 866/1635 cut-off events. [2025-03-04 10:18:09,245 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-04 10:18:09,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 1635 events. 866/1635 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9849 event pairs, 360 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 1728. Up to 601 conditions per place. [2025-03-04 10:18:09,255 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 87 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2025-03-04 10:18:09,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 491 flow [2025-03-04 10:18:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-03-04 10:18:09,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-03-04 10:18:09,257 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 121 flow. Second operand 8 states and 300 transitions. [2025-03-04 10:18:09,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 491 flow [2025-03-04 10:18:09,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:09,259 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 226 flow [2025-03-04 10:18:09,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2025-03-04 10:18:09,261 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-03-04 10:18:09,261 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 226 flow [2025-03-04 10:18:09,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 26.764705882352942) internal successors, (455), 17 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:09,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:09,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:09,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1909243405, now seen corresponding path program 1 times [2025-03-04 10:18:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983819152] [2025-03-04 10:18:09,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:09,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:09,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:09,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:09,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:09,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983819152] [2025-03-04 10:18:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983819152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40982689] [2025-03-04 10:18:09,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:09,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:09,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:09,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:18:09,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:09,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:09,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:09,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:09,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:18:09,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:09,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:09,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40982689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:09,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065520574] [2025-03-04 10:18:09,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:09,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:09,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:09,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 10:18:09,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 226 flow. Second operand has 11 states, 11 states have (on average 21.727272727272727) internal successors, (239), 11 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:09,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 10:18:09,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:10,112 INFO L124 PetriNetUnfolderBase]: 1419/2399 cut-off events. [2025-03-04 10:18:10,113 INFO L125 PetriNetUnfolderBase]: For 1380/1494 co-relation queries the response was YES. [2025-03-04 10:18:10,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 2399 events. 1419/2399 cut-off events. For 1380/1494 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13290 event pairs, 288 based on Foata normal form. 128/2358 useless extension candidates. Maximal degree in co-relation 3627. Up to 1619 conditions per place. [2025-03-04 10:18:10,126 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 57 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2025-03-04 10:18:10,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 434 flow [2025-03-04 10:18:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-03-04 10:18:10,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2025-03-04 10:18:10,127 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 226 flow. Second operand 5 states and 153 transitions. [2025-03-04 10:18:10,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 434 flow [2025-03-04 10:18:10,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:10,133 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 290 flow [2025-03-04 10:18:10,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2025-03-04 10:18:10,134 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2025-03-04 10:18:10,135 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 290 flow [2025-03-04 10:18:10,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.727272727272727) internal successors, (239), 11 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:10,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:10,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:10,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:10,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:10,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash 942997148, now seen corresponding path program 1 times [2025-03-04 10:18:10,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:10,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905147445] [2025-03-04 10:18:10,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:10,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:18:10,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:18:10,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:10,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905147445] [2025-03-04 10:18:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905147445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:10,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610186087] [2025-03-04 10:18:10,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:10,474 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:10,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:18:10,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:18:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:18:10,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:10,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:10,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:10,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610186087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:10,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:18:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276987149] [2025-03-04 10:18:10,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:18:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:18:10,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:18:10,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 10:18:10,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 290 flow. Second operand has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:10,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 10:18:10,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:11,286 INFO L124 PetriNetUnfolderBase]: 1479/2495 cut-off events. [2025-03-04 10:18:11,286 INFO L125 PetriNetUnfolderBase]: For 1829/1976 co-relation queries the response was YES. [2025-03-04 10:18:11,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6550 conditions, 2495 events. 1479/2495 cut-off events. For 1829/1976 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13700 event pairs, 678 based on Foata normal form. 0/2339 useless extension candidates. Maximal degree in co-relation 4018. Up to 1912 conditions per place. [2025-03-04 10:18:11,298 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 79 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-03-04 10:18:11,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 607 flow [2025-03-04 10:18:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2025-03-04 10:18:11,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-03-04 10:18:11,300 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 290 flow. Second operand 7 states and 220 transitions. [2025-03-04 10:18:11,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 607 flow [2025-03-04 10:18:11,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 581 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:11,305 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 338 flow [2025-03-04 10:18:11,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-04 10:18:11,306 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-04 10:18:11,306 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 338 flow [2025-03-04 10:18:11,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:11,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:11,306 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:11,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:18:11,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:11,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:11,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1037226302, now seen corresponding path program 2 times [2025-03-04 10:18:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455009755] [2025-03-04 10:18:11,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:11,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:18:11,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:18:11,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:11,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:11,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455009755] [2025-03-04 10:18:11,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455009755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278132427] [2025-03-04 10:18:11,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:11,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:11,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:11,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:18:11,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:18:11,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:18:11,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:11,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:18:11,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:11,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:18:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:11,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278132427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:11,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:11,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874898671] [2025-03-04 10:18:11,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:11,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:11,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:11,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:11,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:12,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-04 10:18:12,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 338 flow. Second operand has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:12,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:12,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-04 10:18:12,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:12,471 INFO L124 PetriNetUnfolderBase]: 1142/2090 cut-off events. [2025-03-04 10:18:12,471 INFO L125 PetriNetUnfolderBase]: For 1301/1301 co-relation queries the response was YES. [2025-03-04 10:18:12,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5378 conditions, 2090 events. 1142/2090 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12680 event pairs, 579 based on Foata normal form. 0/2026 useless extension candidates. Maximal degree in co-relation 3411. Up to 1321 conditions per place. [2025-03-04 10:18:12,482 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 68 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-03-04 10:18:12,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 634 flow [2025-03-04 10:18:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-04 10:18:12,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-04 10:18:12,483 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 338 flow. Second operand 5 states and 170 transitions. [2025-03-04 10:18:12,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 634 flow [2025-03-04 10:18:12,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 599 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:12,488 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 328 flow [2025-03-04 10:18:12,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-03-04 10:18:12,488 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-04 10:18:12,488 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 328 flow [2025-03-04 10:18:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:12,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:12,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:12,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:12,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:12,689 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:12,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 921950110, now seen corresponding path program 2 times [2025-03-04 10:18:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:12,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643484636] [2025-03-04 10:18:12,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:12,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:18:12,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-04 10:18:12,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643484636] [2025-03-04 10:18:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643484636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:12,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628809646] [2025-03-04 10:18:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:12,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:12,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:12,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:12,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 10:18:12,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:12,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:12,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 10:18:12,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:13,091 INFO L124 PetriNetUnfolderBase]: 1349/2264 cut-off events. [2025-03-04 10:18:13,092 INFO L125 PetriNetUnfolderBase]: For 2824/2824 co-relation queries the response was YES. [2025-03-04 10:18:13,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6285 conditions, 2264 events. 1349/2264 cut-off events. For 2824/2824 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12155 event pairs, 808 based on Foata normal form. 64/2127 useless extension candidates. Maximal degree in co-relation 3834. Up to 1716 conditions per place. [2025-03-04 10:18:13,103 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 56 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2025-03-04 10:18:13,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 69 transitions, 503 flow [2025-03-04 10:18:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-04 10:18:13,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-04 10:18:13,104 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 328 flow. Second operand 5 states and 136 transitions. [2025-03-04 10:18:13,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 69 transitions, 503 flow [2025-03-04 10:18:13,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 471 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:13,108 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 312 flow [2025-03-04 10:18:13,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-04 10:18:13,110 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-03-04 10:18:13,110 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 312 flow [2025-03-04 10:18:13,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:13,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:18:13,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -18838298, now seen corresponding path program 1 times [2025-03-04 10:18:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545833904] [2025-03-04 10:18:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:13,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:13,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:13,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545833904] [2025-03-04 10:18:13,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545833904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31332783] [2025-03-04 10:18:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:13,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:13,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:13,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:18:13,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:13,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:13,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:18:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31332783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:13,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:18:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074980198] [2025-03-04 10:18:13,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:13,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 10:18:13,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 312 flow. Second operand has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:13,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:13,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 10:18:13,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:14,188 INFO L124 PetriNetUnfolderBase]: 1258/2114 cut-off events. [2025-03-04 10:18:14,188 INFO L125 PetriNetUnfolderBase]: For 1776/1776 co-relation queries the response was YES. [2025-03-04 10:18:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 2114 events. 1258/2114 cut-off events. For 1776/1776 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11172 event pairs, 605 based on Foata normal form. 16/2024 useless extension candidates. Maximal degree in co-relation 3630. Up to 986 conditions per place. [2025-03-04 10:18:14,198 INFO L140 encePairwiseOnDemand]: 38/56 looper letters, 85 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2025-03-04 10:18:14,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 687 flow [2025-03-04 10:18:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2025-03-04 10:18:14,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580357142857143 [2025-03-04 10:18:14,200 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 312 flow. Second operand 8 states and 250 transitions. [2025-03-04 10:18:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 687 flow [2025-03-04 10:18:14,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 113 transitions, 665 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:14,204 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 419 flow [2025-03-04 10:18:14,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=419, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2025-03-04 10:18:14,205 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-04 10:18:14,205 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 419 flow [2025-03-04 10:18:14,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:14,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:14,205 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:14,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:14,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:14,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:14,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1229794664, now seen corresponding path program 2 times [2025-03-04 10:18:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684495803] [2025-03-04 10:18:14,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:14,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:18:14,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-03-04 10:18:14,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:14,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684495803] [2025-03-04 10:18:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684495803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538946630] [2025-03-04 10:18:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:14,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:14,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:14,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:14,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 10:18:14,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:14,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:14,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 10:18:14,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:14,870 INFO L124 PetriNetUnfolderBase]: 1146/1918 cut-off events. [2025-03-04 10:18:14,870 INFO L125 PetriNetUnfolderBase]: For 2168/2168 co-relation queries the response was YES. [2025-03-04 10:18:14,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5590 conditions, 1918 events. 1146/1918 cut-off events. For 2168/2168 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9956 event pairs, 100 based on Foata normal form. 16/1876 useless extension candidates. Maximal degree in co-relation 3515. Up to 679 conditions per place. [2025-03-04 10:18:14,882 INFO L140 encePairwiseOnDemand]: 40/56 looper letters, 63 selfloop transitions, 36 changer transitions 0/104 dead transitions. [2025-03-04 10:18:14,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 745 flow [2025-03-04 10:18:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-03-04 10:18:14,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-04 10:18:14,887 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 419 flow. Second operand 7 states and 203 transitions. [2025-03-04 10:18:14,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 745 flow [2025-03-04 10:18:14,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 728 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:14,893 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 503 flow [2025-03-04 10:18:14,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2025-03-04 10:18:14,894 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-04 10:18:14,894 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 503 flow [2025-03-04 10:18:14,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:14,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:14,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:18:14,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:14,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 716125426, now seen corresponding path program 1 times [2025-03-04 10:18:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563788506] [2025-03-04 10:18:14,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:14,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:14,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:14,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:14,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563788506] [2025-03-04 10:18:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563788506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198258769] [2025-03-04 10:18:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:14,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:14,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:14,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:14,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:14,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-03-04 10:18:14,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:14,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:14,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-03-04 10:18:14,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:15,074 INFO L124 PetriNetUnfolderBase]: 1126/1902 cut-off events. [2025-03-04 10:18:15,075 INFO L125 PetriNetUnfolderBase]: For 3290/3290 co-relation queries the response was YES. [2025-03-04 10:18:15,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6264 conditions, 1902 events. 1126/1902 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10042 event pairs, 269 based on Foata normal form. 2/1839 useless extension candidates. Maximal degree in co-relation 4033. Up to 1434 conditions per place. [2025-03-04 10:18:15,083 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 74 selfloop transitions, 11 changer transitions 1/91 dead transitions. [2025-03-04 10:18:15,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 770 flow [2025-03-04 10:18:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 10:18:15,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 10:18:15,085 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 503 flow. Second operand 3 states and 126 transitions. [2025-03-04 10:18:15,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 770 flow [2025-03-04 10:18:15,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 723 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:15,093 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 553 flow [2025-03-04 10:18:15,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2025-03-04 10:18:15,093 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-04 10:18:15,093 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 553 flow [2025-03-04 10:18:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:15,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:15,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:15,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:18:15,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:15,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1146539283, now seen corresponding path program 1 times [2025-03-04 10:18:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072157675] [2025-03-04 10:18:15,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:15,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:18:15,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:18:15,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:15,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:15,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:15,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072157675] [2025-03-04 10:18:15,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072157675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:15,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:15,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:15,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941649592] [2025-03-04 10:18:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:15,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:15,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:15,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:15,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-03-04 10:18:15,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:15,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:15,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-03-04 10:18:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:15,518 INFO L124 PetriNetUnfolderBase]: 1348/2214 cut-off events. [2025-03-04 10:18:15,518 INFO L125 PetriNetUnfolderBase]: For 3596/3596 co-relation queries the response was YES. [2025-03-04 10:18:15,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7389 conditions, 2214 events. 1348/2214 cut-off events. For 3596/3596 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11727 event pairs, 411 based on Foata normal form. 6/2216 useless extension candidates. Maximal degree in co-relation 4822. Up to 1220 conditions per place. [2025-03-04 10:18:15,525 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 160 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-03-04 10:18:15,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1535 flow [2025-03-04 10:18:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2025-03-04 10:18:15,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-04 10:18:15,527 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 553 flow. Second operand 5 states and 195 transitions. [2025-03-04 10:18:15,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1535 flow [2025-03-04 10:18:15,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 171 transitions, 1488 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:15,536 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 605 flow [2025-03-04 10:18:15,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=605, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2025-03-04 10:18:15,537 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2025-03-04 10:18:15,537 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 605 flow [2025-03-04 10:18:15,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:15,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:15,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:15,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:18:15,537 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1539948651, now seen corresponding path program 1 times [2025-03-04 10:18:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260071892] [2025-03-04 10:18:15,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:15,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:18:15,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:18:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:15,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260071892] [2025-03-04 10:18:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260071892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127473808] [2025-03-04 10:18:15,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:15,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:15,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:15,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:15,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:15,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 605 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:15,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:15,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:15,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:15,743 INFO L124 PetriNetUnfolderBase]: 1064/1748 cut-off events. [2025-03-04 10:18:15,743 INFO L125 PetriNetUnfolderBase]: For 3372/3372 co-relation queries the response was YES. [2025-03-04 10:18:15,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6325 conditions, 1748 events. 1064/1748 cut-off events. For 3372/3372 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8269 event pairs, 523 based on Foata normal form. 32/1780 useless extension candidates. Maximal degree in co-relation 3930. Up to 1419 conditions per place. [2025-03-04 10:18:15,750 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 81 selfloop transitions, 12 changer transitions 0/94 dead transitions. [2025-03-04 10:18:15,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 843 flow [2025-03-04 10:18:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-03-04 10:18:15,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2025-03-04 10:18:15,752 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 605 flow. Second operand 4 states and 138 transitions. [2025-03-04 10:18:15,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 843 flow [2025-03-04 10:18:15,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 812 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:15,760 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 519 flow [2025-03-04 10:18:15,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-04 10:18:15,761 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2025-03-04 10:18:15,761 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 519 flow [2025-03-04 10:18:15,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:15,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:15,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:15,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:18:15,762 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 53683641, now seen corresponding path program 2 times [2025-03-04 10:18:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488187295] [2025-03-04 10:18:15,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:15,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:18:15,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 10:18:15,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:15,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488187295] [2025-03-04 10:18:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488187295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:15,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391950942] [2025-03-04 10:18:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:15,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:15,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:15,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:15,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:15,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:15,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:15,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,132 INFO L124 PetriNetUnfolderBase]: 1260/2090 cut-off events. [2025-03-04 10:18:16,132 INFO L125 PetriNetUnfolderBase]: For 4540/4540 co-relation queries the response was YES. [2025-03-04 10:18:16,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7884 conditions, 2090 events. 1260/2090 cut-off events. For 4540/4540 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10841 event pairs, 345 based on Foata normal form. 32/2122 useless extension candidates. Maximal degree in co-relation 5059. Up to 1018 conditions per place. [2025-03-04 10:18:16,141 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 131 selfloop transitions, 20 changer transitions 0/152 dead transitions. [2025-03-04 10:18:16,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 152 transitions, 1361 flow [2025-03-04 10:18:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2025-03-04 10:18:16,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2025-03-04 10:18:16,142 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 519 flow. Second operand 6 states and 219 transitions. [2025-03-04 10:18:16,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 152 transitions, 1361 flow [2025-03-04 10:18:16,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 152 transitions, 1337 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:16,155 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 729 flow [2025-03-04 10:18:16,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-03-04 10:18:16,155 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2025-03-04 10:18:16,155 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 729 flow [2025-03-04 10:18:16,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:16,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:16,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:16,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:18:16,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:16,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2078514121, now seen corresponding path program 3 times [2025-03-04 10:18:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028700925] [2025-03-04 10:18:16,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:16,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:18:16,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 10:18:16,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028700925] [2025-03-04 10:18:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028700925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33373132] [2025-03-04 10:18:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:16,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:16,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:16,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 729 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:16,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:16,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:16,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,415 INFO L124 PetriNetUnfolderBase]: 1292/2154 cut-off events. [2025-03-04 10:18:16,415 INFO L125 PetriNetUnfolderBase]: For 6445/6445 co-relation queries the response was YES. [2025-03-04 10:18:16,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 2154 events. 1292/2154 cut-off events. For 6445/6445 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10865 event pairs, 533 based on Foata normal form. 46/2200 useless extension candidates. Maximal degree in co-relation 6197. Up to 1461 conditions per place. [2025-03-04 10:18:16,424 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 98 selfloop transitions, 22 changer transitions 0/121 dead transitions. [2025-03-04 10:18:16,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1257 flow [2025-03-04 10:18:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-03-04 10:18:16,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964285714285714 [2025-03-04 10:18:16,425 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 729 flow. Second operand 5 states and 167 transitions. [2025-03-04 10:18:16,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1257 flow [2025-03-04 10:18:16,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 1225 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:16,440 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 798 flow [2025-03-04 10:18:16,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=798, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-03-04 10:18:16,440 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2025-03-04 10:18:16,440 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 798 flow [2025-03-04 10:18:16,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:16,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:16,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:16,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:18:16,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:16,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1969814536, now seen corresponding path program 1 times [2025-03-04 10:18:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:16,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148844801] [2025-03-04 10:18:16,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:16,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:18:16,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:16,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:16,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148844801] [2025-03-04 10:18:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148844801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:16,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916700433] [2025-03-04 10:18:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:16,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:16,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:16,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:16,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:16,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 798 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:16,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:16,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:16,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,833 INFO L124 PetriNetUnfolderBase]: 1618/2716 cut-off events. [2025-03-04 10:18:16,833 INFO L125 PetriNetUnfolderBase]: For 9357/9357 co-relation queries the response was YES. [2025-03-04 10:18:16,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 2716 events. 1618/2716 cut-off events. For 9357/9357 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14210 event pairs, 535 based on Foata normal form. 32/2748 useless extension candidates. Maximal degree in co-relation 8959. Up to 1401 conditions per place. [2025-03-04 10:18:16,844 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 125 selfloop transitions, 26 changer transitions 0/152 dead transitions. [2025-03-04 10:18:16,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 152 transitions, 1588 flow [2025-03-04 10:18:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-03-04 10:18:16,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2025-03-04 10:18:16,845 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 798 flow. Second operand 7 states and 233 transitions. [2025-03-04 10:18:16,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 152 transitions, 1588 flow [2025-03-04 10:18:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 1550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:16,865 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 960 flow [2025-03-04 10:18:16,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=960, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-03-04 10:18:16,865 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2025-03-04 10:18:16,865 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 960 flow [2025-03-04 10:18:16,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:16,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:16,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:16,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:18:16,866 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:16,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash 884752644, now seen corresponding path program 2 times [2025-03-04 10:18:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317745411] [2025-03-04 10:18:16,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:16,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:18:16,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 10:18:16,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317745411] [2025-03-04 10:18:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317745411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:16,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:16,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456959095] [2025-03-04 10:18:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:16,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:16,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:16,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:16,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:16,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 960 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:16,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:16,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:16,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:17,241 INFO L124 PetriNetUnfolderBase]: 1580/2624 cut-off events. [2025-03-04 10:18:17,241 INFO L125 PetriNetUnfolderBase]: For 12228/12228 co-relation queries the response was YES. [2025-03-04 10:18:17,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11546 conditions, 2624 events. 1580/2624 cut-off events. For 12228/12228 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13671 event pairs, 505 based on Foata normal form. 6/2630 useless extension candidates. Maximal degree in co-relation 10341. Up to 1318 conditions per place. [2025-03-04 10:18:17,250 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 120 selfloop transitions, 28 changer transitions 0/149 dead transitions. [2025-03-04 10:18:17,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 149 transitions, 1676 flow [2025-03-04 10:18:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-03-04 10:18:17,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6535714285714286 [2025-03-04 10:18:17,251 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 960 flow. Second operand 5 states and 183 transitions. [2025-03-04 10:18:17,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 149 transitions, 1676 flow [2025-03-04 10:18:17,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 149 transitions, 1626 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:17,275 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 1056 flow [2025-03-04 10:18:17,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1056, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2025-03-04 10:18:17,276 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2025-03-04 10:18:17,276 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 1056 flow [2025-03-04 10:18:17,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:17,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:17,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:17,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:18:17,276 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:17,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash -132731122, now seen corresponding path program 3 times [2025-03-04 10:18:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659851157] [2025-03-04 10:18:17,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:17,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:18:17,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 10:18:17,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:17,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659851157] [2025-03-04 10:18:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659851157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:17,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012704592] [2025-03-04 10:18:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:17,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:17,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:17,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:17,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:17,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 1056 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:17,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:17,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:17,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:17,620 INFO L124 PetriNetUnfolderBase]: 1574/2618 cut-off events. [2025-03-04 10:18:17,620 INFO L125 PetriNetUnfolderBase]: For 14078/14078 co-relation queries the response was YES. [2025-03-04 10:18:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11874 conditions, 2618 events. 1574/2618 cut-off events. For 14078/14078 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13356 event pairs, 751 based on Foata normal form. 6/2624 useless extension candidates. Maximal degree in co-relation 10774. Up to 2165 conditions per place. [2025-03-04 10:18:17,630 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 91 selfloop transitions, 35 changer transitions 0/127 dead transitions. [2025-03-04 10:18:17,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1615 flow [2025-03-04 10:18:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2025-03-04 10:18:17,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-03-04 10:18:17,631 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 1056 flow. Second operand 5 states and 169 transitions. [2025-03-04 10:18:17,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1615 flow [2025-03-04 10:18:17,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 1559 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:17,653 INFO L231 Difference]: Finished difference. Result has 100 places, 107 transitions, 1334 flow [2025-03-04 10:18:17,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1334, PETRI_PLACES=100, PETRI_TRANSITIONS=107} [2025-03-04 10:18:17,653 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places. [2025-03-04 10:18:17,654 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 1334 flow [2025-03-04 10:18:17,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:17,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:17,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:18:17,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1761255276, now seen corresponding path program 4 times [2025-03-04 10:18:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278153637] [2025-03-04 10:18:17,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:17,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:18:17,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:17,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:17,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:17,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278153637] [2025-03-04 10:18:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278153637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:17,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:18:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021293592] [2025-03-04 10:18:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:18:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:17,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:18:17,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:18:17,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:17,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 1334 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 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-03-04 10:18:17,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:17,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:17,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:18,575 INFO L124 PetriNetUnfolderBase]: 1740/2890 cut-off events. [2025-03-04 10:18:18,575 INFO L125 PetriNetUnfolderBase]: For 16667/16667 co-relation queries the response was YES. [2025-03-04 10:18:18,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13242 conditions, 2890 events. 1740/2890 cut-off events. For 16667/16667 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15096 event pairs, 701 based on Foata normal form. 54/2944 useless extension candidates. Maximal degree in co-relation 12155. Up to 1997 conditions per place. [2025-03-04 10:18:18,587 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 140 selfloop transitions, 73 changer transitions 0/214 dead transitions. [2025-03-04 10:18:18,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 214 transitions, 2569 flow [2025-03-04 10:18:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:18:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:18:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 427 transitions. [2025-03-04 10:18:18,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-03-04 10:18:18,588 INFO L175 Difference]: Start difference. First operand has 100 places, 107 transitions, 1334 flow. Second operand 14 states and 427 transitions. [2025-03-04 10:18:18,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 214 transitions, 2569 flow [2025-03-04 10:18:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 214 transitions, 2512 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:18,619 INFO L231 Difference]: Finished difference. Result has 121 places, 146 transitions, 1990 flow [2025-03-04 10:18:18,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1990, PETRI_PLACES=121, PETRI_TRANSITIONS=146} [2025-03-04 10:18:18,619 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2025-03-04 10:18:18,619 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 1990 flow [2025-03-04 10:18:18,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 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-03-04 10:18:18,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:18,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:18,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:18:18,620 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:18,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1078114937, now seen corresponding path program 1 times [2025-03-04 10:18:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758889544] [2025-03-04 10:18:18,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:18,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:18:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:18:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:18,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758889544] [2025-03-04 10:18:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758889544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:18,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:18,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:18:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190208584] [2025-03-04 10:18:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:18,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:18:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:18,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:18:18,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:18:18,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:18,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 1990 flow. Second operand has 9 states, 9 states have (on average 24.555555555555557) internal successors, (221), 9 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:18,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:18,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:18,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:19,534 INFO L124 PetriNetUnfolderBase]: 2772/4661 cut-off events. [2025-03-04 10:18:19,535 INFO L125 PetriNetUnfolderBase]: For 30623/30623 co-relation queries the response was YES. [2025-03-04 10:18:19,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23387 conditions, 4661 events. 2772/4661 cut-off events. For 30623/30623 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 27590 event pairs, 768 based on Foata normal form. 44/4705 useless extension candidates. Maximal degree in co-relation 21362. Up to 1544 conditions per place. [2025-03-04 10:18:19,563 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 275 selfloop transitions, 83 changer transitions 0/359 dead transitions. [2025-03-04 10:18:19,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 359 transitions, 4664 flow [2025-03-04 10:18:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 398 transitions. [2025-03-04 10:18:19,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461038961038961 [2025-03-04 10:18:19,564 INFO L175 Difference]: Start difference. First operand has 121 places, 146 transitions, 1990 flow. Second operand 11 states and 398 transitions. [2025-03-04 10:18:19,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 359 transitions, 4664 flow [2025-03-04 10:18:19,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 359 transitions, 4530 flow, removed 43 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:19,640 INFO L231 Difference]: Finished difference. Result has 138 places, 193 transitions, 2932 flow [2025-03-04 10:18:19,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2932, PETRI_PLACES=138, PETRI_TRANSITIONS=193} [2025-03-04 10:18:19,640 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places. [2025-03-04 10:18:19,640 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 193 transitions, 2932 flow [2025-03-04 10:18:19,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.555555555555557) internal successors, (221), 9 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:19,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:19,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:18:19,641 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -783190931, now seen corresponding path program 2 times [2025-03-04 10:18:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716961741] [2025-03-04 10:18:19,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:19,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:18:19,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 24 statements. [2025-03-04 10:18:19,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716961741] [2025-03-04 10:18:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716961741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192060790] [2025-03-04 10:18:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:19,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:19,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:19,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:19,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 193 transitions, 2932 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:19,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:19,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:19,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:20,296 INFO L124 PetriNetUnfolderBase]: 2694/4575 cut-off events. [2025-03-04 10:18:20,296 INFO L125 PetriNetUnfolderBase]: For 41211/41211 co-relation queries the response was YES. [2025-03-04 10:18:20,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25671 conditions, 4575 events. 2694/4575 cut-off events. For 41211/41211 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 26974 event pairs, 969 based on Foata normal form. 70/4645 useless extension candidates. Maximal degree in co-relation 24626. Up to 2462 conditions per place. [2025-03-04 10:18:20,321 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 196 selfloop transitions, 80 changer transitions 0/277 dead transitions. [2025-03-04 10:18:20,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 277 transitions, 4503 flow [2025-03-04 10:18:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-03-04 10:18:20,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790816326530612 [2025-03-04 10:18:20,322 INFO L175 Difference]: Start difference. First operand has 138 places, 193 transitions, 2932 flow. Second operand 7 states and 227 transitions. [2025-03-04 10:18:20,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 277 transitions, 4503 flow [2025-03-04 10:18:20,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 277 transitions, 4327 flow, removed 88 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:20,405 INFO L231 Difference]: Finished difference. Result has 147 places, 199 transitions, 3171 flow [2025-03-04 10:18:20,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2848, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3171, PETRI_PLACES=147, PETRI_TRANSITIONS=199} [2025-03-04 10:18:20,405 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 93 predicate places. [2025-03-04 10:18:20,406 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 199 transitions, 3171 flow [2025-03-04 10:18:20,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:20,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:20,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:20,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:18:20,406 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:20,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash 856680437, now seen corresponding path program 1 times [2025-03-04 10:18:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474126077] [2025-03-04 10:18:20,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:20,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:18:20,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:20,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:20,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474126077] [2025-03-04 10:18:20,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474126077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:20,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:20,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796304482] [2025-03-04 10:18:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:20,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:20,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:20,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:20,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-03-04 10:18:20,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 199 transitions, 3171 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:20,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:20,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-03-04 10:18:20,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:21,441 INFO L124 PetriNetUnfolderBase]: 2754/4779 cut-off events. [2025-03-04 10:18:21,441 INFO L125 PetriNetUnfolderBase]: For 44235/44251 co-relation queries the response was YES. [2025-03-04 10:18:21,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26881 conditions, 4779 events. 2754/4779 cut-off events. For 44235/44251 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 29899 event pairs, 659 based on Foata normal form. 26/4805 useless extension candidates. Maximal degree in co-relation 25095. Up to 1482 conditions per place. [2025-03-04 10:18:21,473 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 327 selfloop transitions, 88 changer transitions 0/417 dead transitions. [2025-03-04 10:18:21,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 417 transitions, 6002 flow [2025-03-04 10:18:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:18:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:18:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 436 transitions. [2025-03-04 10:18:21,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-03-04 10:18:21,474 INFO L175 Difference]: Start difference. First operand has 147 places, 199 transitions, 3171 flow. Second operand 12 states and 436 transitions. [2025-03-04 10:18:21,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 417 transitions, 6002 flow [2025-03-04 10:18:21,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 417 transitions, 5824 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:21,587 INFO L231 Difference]: Finished difference. Result has 162 places, 224 transitions, 3683 flow [2025-03-04 10:18:21,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3050, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3683, PETRI_PLACES=162, PETRI_TRANSITIONS=224} [2025-03-04 10:18:21,588 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 108 predicate places. [2025-03-04 10:18:21,588 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 224 transitions, 3683 flow [2025-03-04 10:18:21,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:21,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:21,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:21,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:18:21,588 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:21,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1509114741, now seen corresponding path program 2 times [2025-03-04 10:18:21,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387142736] [2025-03-04 10:18:21,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:21,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:21,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:18:21,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:21,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:21,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387142736] [2025-03-04 10:18:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387142736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238008746] [2025-03-04 10:18:21,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:21,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:21,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:21,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:21,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:18:21,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:18:21,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:21,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:21,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:18:21,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:21,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:21,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:18:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:21,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:22,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 10:18:22,134 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:18:22,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-04 10:18:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238008746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 10:18:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244000085] [2025-03-04 10:18:22,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:18:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:22,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:18:22,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:18:22,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:22,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 224 transitions, 3683 flow. Second operand has 18 states, 18 states have (on average 25.833333333333332) internal successors, (465), 18 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:22,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:22,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:22,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:24,496 INFO L124 PetriNetUnfolderBase]: 3465/5916 cut-off events. [2025-03-04 10:18:24,496 INFO L125 PetriNetUnfolderBase]: For 60427/60427 co-relation queries the response was YES. [2025-03-04 10:18:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34817 conditions, 5916 events. 3465/5916 cut-off events. For 60427/60427 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 36118 event pairs, 394 based on Foata normal form. 23/5939 useless extension candidates. Maximal degree in co-relation 33672. Up to 1027 conditions per place. [2025-03-04 10:18:24,526 INFO L140 encePairwiseOnDemand]: 36/56 looper letters, 262 selfloop transitions, 133 changer transitions 243/639 dead transitions. [2025-03-04 10:18:24,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 639 transitions, 8926 flow [2025-03-04 10:18:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:18:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 10:18:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1123 transitions. [2025-03-04 10:18:24,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076839826839827 [2025-03-04 10:18:24,528 INFO L175 Difference]: Start difference. First operand has 162 places, 224 transitions, 3683 flow. Second operand 33 states and 1123 transitions. [2025-03-04 10:18:24,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 639 transitions, 8926 flow [2025-03-04 10:18:24,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 639 transitions, 8807 flow, removed 36 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:24,687 INFO L231 Difference]: Finished difference. Result has 204 places, 218 transitions, 3584 flow [2025-03-04 10:18:24,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3584, PETRI_PLACES=204, PETRI_TRANSITIONS=218} [2025-03-04 10:18:24,687 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places. [2025-03-04 10:18:24,687 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 218 transitions, 3584 flow [2025-03-04 10:18:24,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 25.833333333333332) internal successors, (465), 18 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:24,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:24,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:24,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:24,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:18:24,888 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1573247713, now seen corresponding path program 3 times [2025-03-04 10:18:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92375344] [2025-03-04 10:18:24,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:24,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:18:24,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 10:18:24,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:24,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92375344] [2025-03-04 10:18:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92375344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:24,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983810131] [2025-03-04 10:18:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:24,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:24,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:25,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:25,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 218 transitions, 3584 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:25,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:25,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:25,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,606 INFO L124 PetriNetUnfolderBase]: 2149/3766 cut-off events. [2025-03-04 10:18:25,606 INFO L125 PetriNetUnfolderBase]: For 43215/43215 co-relation queries the response was YES. [2025-03-04 10:18:25,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23208 conditions, 3766 events. 2149/3766 cut-off events. For 43215/43215 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 21330 event pairs, 948 based on Foata normal form. 28/3794 useless extension candidates. Maximal degree in co-relation 23040. Up to 2561 conditions per place. [2025-03-04 10:18:25,631 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 262 selfloop transitions, 60 changer transitions 0/323 dead transitions. [2025-03-04 10:18:25,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 323 transitions, 5400 flow [2025-03-04 10:18:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 314 transitions. [2025-03-04 10:18:25,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-03-04 10:18:25,632 INFO L175 Difference]: Start difference. First operand has 204 places, 218 transitions, 3584 flow. Second operand 9 states and 314 transitions. [2025-03-04 10:18:25,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 323 transitions, 5400 flow [2025-03-04 10:18:25,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 323 transitions, 4945 flow, removed 180 selfloop flow, removed 17 redundant places. [2025-03-04 10:18:25,763 INFO L231 Difference]: Finished difference. Result has 186 places, 223 transitions, 3412 flow [2025-03-04 10:18:25,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3412, PETRI_PLACES=186, PETRI_TRANSITIONS=223} [2025-03-04 10:18:25,764 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 132 predicate places. [2025-03-04 10:18:25,764 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 223 transitions, 3412 flow [2025-03-04 10:18:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:25,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:25,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:18:25,764 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:25,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 112712003, now seen corresponding path program 4 times [2025-03-04 10:18:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666019658] [2025-03-04 10:18:25,765 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:25,769 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:18:25,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:25,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:25,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666019658] [2025-03-04 10:18:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666019658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912899363] [2025-03-04 10:18:25,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:25,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:25,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:25,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:18:25,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:18:25,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:25,952 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:25,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:18:25,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:25,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:26,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:18:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:26,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:26,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 10:18:26,307 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:18:26,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-04 10:18:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912899363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:26,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-04 10:18:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291034392] [2025-03-04 10:18:26,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:18:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:18:26,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:18:26,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-03-04 10:18:26,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 223 transitions, 3412 flow. Second operand has 18 states, 18 states have (on average 29.11111111111111) internal successors, (524), 18 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:26,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-03-04 10:18:26,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:27,672 INFO L124 PetriNetUnfolderBase]: 2297/4157 cut-off events. [2025-03-04 10:18:27,672 INFO L125 PetriNetUnfolderBase]: For 41439/41463 co-relation queries the response was YES. [2025-03-04 10:18:27,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24075 conditions, 4157 events. 2297/4157 cut-off events. For 41439/41463 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25387 event pairs, 523 based on Foata normal form. 4/4114 useless extension candidates. Maximal degree in co-relation 23673. Up to 2569 conditions per place. [2025-03-04 10:18:27,703 INFO L140 encePairwiseOnDemand]: 41/56 looper letters, 172 selfloop transitions, 65 changer transitions 78/334 dead transitions. [2025-03-04 10:18:27,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 334 transitions, 5239 flow [2025-03-04 10:18:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:18:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:18:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 456 transitions. [2025-03-04 10:18:27,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263736263736264 [2025-03-04 10:18:27,704 INFO L175 Difference]: Start difference. First operand has 186 places, 223 transitions, 3412 flow. Second operand 13 states and 456 transitions. [2025-03-04 10:18:27,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 334 transitions, 5239 flow [2025-03-04 10:18:27,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 334 transitions, 5104 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:27,832 INFO L231 Difference]: Finished difference. Result has 196 places, 216 transitions, 3299 flow [2025-03-04 10:18:27,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3299, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2025-03-04 10:18:27,833 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 142 predicate places. [2025-03-04 10:18:27,833 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 3299 flow [2025-03-04 10:18:27,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.11111111111111) internal successors, (524), 18 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:27,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:27,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:27,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:28,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:18:28,034 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash -971040493, now seen corresponding path program 5 times [2025-03-04 10:18:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124654230] [2025-03-04 10:18:28,035 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:18:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:28,039 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 10:18:28,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:28,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:18:28,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124654230] [2025-03-04 10:18:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124654230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897031543] [2025-03-04 10:18:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:28,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:28,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:28,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:28,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 3299 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:28,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:28,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:28,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:28,819 INFO L124 PetriNetUnfolderBase]: 2404/4084 cut-off events. [2025-03-04 10:18:28,819 INFO L125 PetriNetUnfolderBase]: For 40403/40403 co-relation queries the response was YES. [2025-03-04 10:18:28,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24092 conditions, 4084 events. 2404/4084 cut-off events. For 40403/40403 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22666 event pairs, 1220 based on Foata normal form. 24/4108 useless extension candidates. Maximal degree in co-relation 24019. Up to 3105 conditions per place. [2025-03-04 10:18:28,848 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 226 selfloop transitions, 57 changer transitions 0/284 dead transitions. [2025-03-04 10:18:28,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 284 transitions, 4511 flow [2025-03-04 10:18:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2025-03-04 10:18:28,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026785714285714 [2025-03-04 10:18:28,849 INFO L175 Difference]: Start difference. First operand has 196 places, 216 transitions, 3299 flow. Second operand 8 states and 270 transitions. [2025-03-04 10:18:28,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 284 transitions, 4511 flow [2025-03-04 10:18:28,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 284 transitions, 4258 flow, removed 97 selfloop flow, removed 10 redundant places. [2025-03-04 10:18:28,957 INFO L231 Difference]: Finished difference. Result has 179 places, 222 transitions, 3361 flow [2025-03-04 10:18:28,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3361, PETRI_PLACES=179, PETRI_TRANSITIONS=222} [2025-03-04 10:18:28,958 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 125 predicate places. [2025-03-04 10:18:28,958 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 222 transitions, 3361 flow [2025-03-04 10:18:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:28,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:28,958 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:28,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 10:18:28,958 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:18:28,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash 183805209, now seen corresponding path program 1 times [2025-03-04 10:18:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:28,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160677089] [2025-03-04 10:18:28,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:28,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:18:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:28,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:28,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160677089] [2025-03-04 10:18:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160677089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247027670] [2025-03-04 10:18:29,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:29,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:29,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:29,136 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:29,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:18:29,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:18:29,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:29,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:29,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:29,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:18:29,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:29,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247027670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:29,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:29,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-04 10:18:29,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727499897] [2025-03-04 10:18:29,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:29,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:18:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:29,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:18:29,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:18:29,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 10:18:29,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 222 transitions, 3361 flow. Second operand has 24 states, 24 states have (on average 23.833333333333332) internal successors, (572), 24 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:29,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:29,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 10:18:29,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:48,235 WARN L286 SmtUtils]: Spent 16.92s on a formula simplification. DAG size of input: 40 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 10:19:07,019 WARN L286 SmtUtils]: Spent 13.59s on a formula simplification. DAG size of input: 31 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 10:19:27,221 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 33 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)