./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:28:59,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:28:59,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:28:59,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:28:59,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:28:59,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:28:59,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:28:59,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:28:59,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:28:59,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:28:59,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:28:59,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:28:59,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:28:59,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:28:59,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:28:59,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:28:59,619 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:28:59,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:28:59,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:28:59,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:28:59,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:28:59,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:28:59,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:28:59,621 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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-03-17 14:28:59,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:28:59,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:28:59,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:28:59,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:28:59,883 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:28:59,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-17 14:29:01,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d79b7399/d058cf1137da454c82b14a2d5254be20/FLAG0637c2804 [2025-03-17 14:29:01,257 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:29:01,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-17 14:29:01,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d79b7399/d058cf1137da454c82b14a2d5254be20/FLAG0637c2804 [2025-03-17 14:29:01,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d79b7399/d058cf1137da454c82b14a2d5254be20 [2025-03-17 14:29:01,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:29:01,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:29:01,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:29:01,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:29:01,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:29:01,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19211522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01, skipping insertion in model container [2025-03-17 14:29:01,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:29:01,485 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-17 14:29:01,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:29:01,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:29:01,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:29:01,536 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:29:01,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01 WrapperNode [2025-03-17 14:29:01,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:29:01,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:29:01,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:29:01,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:29:01,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,566 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 276 [2025-03-17 14:29:01,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:29:01,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:29:01,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:29:01,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:29:01,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,595 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 14:29:01,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:29:01,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:29:01,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:29:01,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:29:01,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (1/1) ... [2025-03-17 14:29:01,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:29:01,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:01,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:29:01,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:29:01,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:29:01,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:29:01,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:29:01,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:29:01,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:29:01,653 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:29:01,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:29:01,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:29:02,074 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:29:02,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:29:02,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:29:02,326 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:29:02,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:29:02 BoogieIcfgContainer [2025-03-17 14:29:02,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:29:02,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:29:02,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:29:02,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:29:02,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:29:01" (1/3) ... [2025-03-17 14:29:02,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21965a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:29:02, skipping insertion in model container [2025-03-17 14:29:02,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:01" (2/3) ... [2025-03-17 14:29:02,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21965a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:29:02, skipping insertion in model container [2025-03-17 14:29:02,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:29:02" (3/3) ... [2025-03-17 14:29:02,335 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-03-17 14:29:02,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:29:02,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-17 14:29:02,350 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:29:02,409 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:29:02,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2025-03-17 14:29:02,463 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2025-03-17 14:29:02,465 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:29:02,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 122 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-17 14:29:02,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2025-03-17 14:29:02,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2025-03-17 14:29:02,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:29:02,492 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;@2f2c2c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:29:02,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 14:29:02,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:29:02,497 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:29:02,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:29:02,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:02,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:02,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash 761341, now seen corresponding path program 1 times [2025-03-17 14:29:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984470733] [2025-03-17 14:29:02,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:02,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:02,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:02,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:02,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:02,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984470733] [2025-03-17 14:29:02,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984470733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:02,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:02,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:29:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908212762] [2025-03-17 14:29:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:02,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:02,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:02,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:02,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:02,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:02,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:02,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:02,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:03,950 INFO L124 PetriNetUnfolderBase]: 11253/15061 cut-off events. [2025-03-17 14:29:03,950 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-03-17 14:29:03,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30470 conditions, 15061 events. 11253/15061 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 84502 event pairs, 9160 based on Foata normal form. 1/10576 useless extension candidates. Maximal degree in co-relation 28212. Up to 14621 conditions per place. [2025-03-17 14:29:04,072 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-17 14:29:04,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 222 flow [2025-03-17 14:29:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-17 14:29:04,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-03-17 14:29:04,084 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 95 transitions. [2025-03-17 14:29:04,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 222 flow [2025-03-17 14:29:04,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 206 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:29:04,145 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2025-03-17 14:29:04,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-17 14:29:04,150 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-03-17 14:29:04,150 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2025-03-17 14:29:04,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:04,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:04,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:04,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:29:04,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:04,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 761342, now seen corresponding path program 1 times [2025-03-17 14:29:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167179479] [2025-03-17 14:29:04,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:04,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:04,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:04,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:04,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167179479] [2025-03-17 14:29:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167179479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:04,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:04,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-03-17 14:29:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:04,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:04,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:04,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:04,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:04,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:04,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:04,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:04,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:05,383 INFO L124 PetriNetUnfolderBase]: 11253/15060 cut-off events. [2025-03-17 14:29:05,384 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 14:29:05,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29951 conditions, 15060 events. 11253/15060 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 84442 event pairs, 9160 based on Foata normal form. 0/10574 useless extension candidates. Maximal degree in co-relation 29930. Up to 14625 conditions per place. [2025-03-17 14:29:05,441 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 41 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-03-17 14:29:05,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 210 flow [2025-03-17 14:29:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-17 14:29:05,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2025-03-17 14:29:05,444 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 110 transitions. [2025-03-17 14:29:05,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 210 flow [2025-03-17 14:29:05,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:05,446 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 124 flow [2025-03-17 14:29:05,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-03-17 14:29:05,447 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-03-17 14:29:05,447 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 124 flow [2025-03-17 14:29:05,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:05,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:05,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:29:05,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:29:05,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash 23602610, now seen corresponding path program 1 times [2025-03-17 14:29:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:05,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372659404] [2025-03-17 14:29:05,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:05,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:29:05,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:29:05,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:05,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:05,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372659404] [2025-03-17 14:29:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372659404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513277777] [2025-03-17 14:29:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:05,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:05,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:05,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:29:05,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:05,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:05,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:05,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:05,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:06,395 INFO L124 PetriNetUnfolderBase]: 11255/15066 cut-off events. [2025-03-17 14:29:06,395 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 14:29:06,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29968 conditions, 15066 events. 11255/15066 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 84576 event pairs, 9160 based on Foata normal form. 0/10577 useless extension candidates. Maximal degree in co-relation 29944. Up to 14628 conditions per place. [2025-03-17 14:29:06,451 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 44 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-17 14:29:06,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 244 flow [2025-03-17 14:29:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-17 14:29:06,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-03-17 14:29:06,456 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 124 flow. Second operand 5 states and 132 transitions. [2025-03-17 14:29:06,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 244 flow [2025-03-17 14:29:06,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:06,459 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 169 flow [2025-03-17 14:29:06,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-03-17 14:29:06,461 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-17 14:29:06,461 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 169 flow [2025-03-17 14:29:06,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:06,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:06,461 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:29:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:29:06,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:06,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1207295244, now seen corresponding path program 1 times [2025-03-17 14:29:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-03-17 14:29:06,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:06,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:06,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:06,664 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-17 14:29:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-03-17 14:29:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825119936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928421416] [2025-03-17 14:29:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:06,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:06,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:06,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:06,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:29:06,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:06,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:06,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:29:06,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:06,792 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-17 14:29:06,884 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-17 14:29:06,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:07,010 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-17 14:29:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928421416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:07,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:07,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:29:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578842070] [2025-03-17 14:29:07,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:07,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:29:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:07,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:29:07,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:29:07,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:07,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:07,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:07,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:08,244 INFO L124 PetriNetUnfolderBase]: 11257/15071 cut-off events. [2025-03-17 14:29:08,244 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-17 14:29:08,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30000 conditions, 15071 events. 11257/15071 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 84675 event pairs, 9160 based on Foata normal form. 0/10585 useless extension candidates. Maximal degree in co-relation 29940. Up to 14622 conditions per place. [2025-03-17 14:29:08,329 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 38 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2025-03-17 14:29:08,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 303 flow [2025-03-17 14:29:08,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:29:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:29:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2025-03-17 14:29:08,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2025-03-17 14:29:08,331 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 169 flow. Second operand 9 states and 202 transitions. [2025-03-17 14:29:08,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 303 flow [2025-03-17 14:29:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:08,333 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 226 flow [2025-03-17 14:29:08,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2025-03-17 14:29:08,334 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-17 14:29:08,334 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 226 flow [2025-03-17 14:29:08,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:08,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:08,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:08,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:29:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:08,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 652183438, now seen corresponding path program 1 times [2025-03-17 14:29:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328609320] [2025-03-17 14:29:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:29:08,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:29:08,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328609320] [2025-03-17 14:29:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328609320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:08,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:08,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807561523] [2025-03-17 14:29:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:08,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:08,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:08,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:08,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-17 14:29:08,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-17 14:29:08,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:08,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-17 14:29:08,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:09,405 INFO L124 PetriNetUnfolderBase]: 13736/18598 cut-off events. [2025-03-17 14:29:09,405 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-17 14:29:09,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37060 conditions, 18598 events. 13736/18598 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 108350 event pairs, 11357 based on Foata normal form. 541/14314 useless extension candidates. Maximal degree in co-relation 29944. Up to 14636 conditions per place. [2025-03-17 14:29:09,481 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 91 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2025-03-17 14:29:09,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 540 flow [2025-03-17 14:29:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-03-17 14:29:09,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61328125 [2025-03-17 14:29:09,482 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 226 flow. Second operand 4 states and 157 transitions. [2025-03-17 14:29:09,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 540 flow [2025-03-17 14:29:09,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 472 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-03-17 14:29:09,484 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 199 flow [2025-03-17 14:29:09,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2025-03-17 14:29:09,485 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-17 14:29:09,485 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 199 flow [2025-03-17 14:29:09,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-17 14:29:09,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:09,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:09,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:29:09,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -972433399, now seen corresponding path program 1 times [2025-03-17 14:29:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:09,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509740057] [2025-03-17 14:29:09,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:09,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509740057] [2025-03-17 14:29:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509740057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292245851] [2025-03-17 14:29:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:09,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:09,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:09,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:09,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:09,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:09,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:09,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:09,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:10,080 INFO L124 PetriNetUnfolderBase]: 9806/13370 cut-off events. [2025-03-17 14:29:10,080 INFO L125 PetriNetUnfolderBase]: For 797/797 co-relation queries the response was YES. [2025-03-17 14:29:10,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28893 conditions, 13370 events. 9806/13370 cut-off events. For 797/797 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 75262 event pairs, 7927 based on Foata normal form. 0/10410 useless extension candidates. Maximal degree in co-relation 23805. Up to 12896 conditions per place. [2025-03-17 14:29:10,126 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-17 14:29:10,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 303 flow [2025-03-17 14:29:10,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-17 14:29:10,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-03-17 14:29:10,127 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 199 flow. Second operand 4 states and 108 transitions. [2025-03-17 14:29:10,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 303 flow [2025-03-17 14:29:10,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 299 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:10,130 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 199 flow [2025-03-17 14:29:10,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2025-03-17 14:29:10,131 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-17 14:29:10,131 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 199 flow [2025-03-17 14:29:10,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:10,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:10,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:10,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:29:10,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:10,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash -972433398, now seen corresponding path program 1 times [2025-03-17 14:29:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613290745] [2025-03-17 14:29:10,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:10,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:10,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:10,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613290745] [2025-03-17 14:29:10,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613290745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:10,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:10,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:10,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442365] [2025-03-17 14:29:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:10,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:10,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:10,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:10,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-17 14:29:10,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:10,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:10,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-17 14:29:10,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:10,951 INFO L124 PetriNetUnfolderBase]: 13003/18111 cut-off events. [2025-03-17 14:29:10,951 INFO L125 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2025-03-17 14:29:10,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39205 conditions, 18111 events. 13003/18111 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 109640 event pairs, 10818 based on Foata normal form. 569/15372 useless extension candidates. Maximal degree in co-relation 23758. Up to 12912 conditions per place. [2025-03-17 14:29:11,020 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 78 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-03-17 14:29:11,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 443 flow [2025-03-17 14:29:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-03-17 14:29:11,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-03-17 14:29:11,021 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 199 flow. Second operand 4 states and 150 transitions. [2025-03-17 14:29:11,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 443 flow [2025-03-17 14:29:11,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 433 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:11,025 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 208 flow [2025-03-17 14:29:11,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-17 14:29:11,025 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-17 14:29:11,025 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 208 flow [2025-03-17 14:29:11,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:11,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:11,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:11,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:29:11,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:11,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1696779568, now seen corresponding path program 1 times [2025-03-17 14:29:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:11,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-17 14:29:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:11,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:11,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:11,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:11,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-17 14:29:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307157604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076514981] [2025-03-17 14:29:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:11,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:11,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:11,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:11,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:11,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:11,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:11,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:11,865 INFO L124 PetriNetUnfolderBase]: 9866/13812 cut-off events. [2025-03-17 14:29:11,865 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2025-03-17 14:29:11,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30991 conditions, 13812 events. 9866/13812 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 81293 event pairs, 8104 based on Foata normal form. 0/11748 useless extension candidates. Maximal degree in co-relation 17709. Up to 13242 conditions per place. [2025-03-17 14:29:11,926 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-03-17 14:29:11,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 304 flow [2025-03-17 14:29:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-17 14:29:11,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38125 [2025-03-17 14:29:11,927 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 208 flow. Second operand 5 states and 122 transitions. [2025-03-17 14:29:11,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 304 flow [2025-03-17 14:29:11,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:11,930 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 210 flow [2025-03-17 14:29:11,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-03-17 14:29:11,931 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-17 14:29:11,931 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 210 flow [2025-03-17 14:29:11,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:11,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:11,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:11,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:29:11,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:11,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1696779567, now seen corresponding path program 1 times [2025-03-17 14:29:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-03-17 14:29:11,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:11,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:11,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:11,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:11,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-03-17 14:29:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471045538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:12,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:12,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120451130] [2025-03-17 14:29:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:12,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:12,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:12,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:29:12,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2025-03-17 14:29:12,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:12,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:12,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2025-03-17 14:29:12,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:12,506 INFO L124 PetriNetUnfolderBase]: 7273/10257 cut-off events. [2025-03-17 14:29:12,507 INFO L125 PetriNetUnfolderBase]: For 1392/1392 co-relation queries the response was YES. [2025-03-17 14:29:12,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22459 conditions, 10257 events. 7273/10257 cut-off events. For 1392/1392 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 58363 event pairs, 5890 based on Foata normal form. 0/9374 useless extension candidates. Maximal degree in co-relation 11296. Up to 9846 conditions per place. [2025-03-17 14:29:12,542 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 46 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-17 14:29:12,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 302 flow [2025-03-17 14:29:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-17 14:29:12,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-03-17 14:29:12,543 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 210 flow. Second operand 4 states and 104 transitions. [2025-03-17 14:29:12,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 302 flow [2025-03-17 14:29:12,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:12,546 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 199 flow [2025-03-17 14:29:12,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2025-03-17 14:29:12,546 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-17 14:29:12,546 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 199 flow [2025-03-17 14:29:12,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:12,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:12,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:12,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:29:12,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:12,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1545806820, now seen corresponding path program 1 times [2025-03-17 14:29:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:12,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-17 14:29:12,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:12,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:29:12,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:12,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-17 14:29:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662980914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100280566] [2025-03-17 14:29:12,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:12,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:12,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:29:12,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:29:12,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:12,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:12,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:12,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:29:12,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:12,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100280566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 14:29:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061322376] [2025-03-17 14:29:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:12,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:12,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:29:12,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-17 14:29:12,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:12,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:12,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-17 14:29:12,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:13,134 INFO L124 PetriNetUnfolderBase]: 5447/7795 cut-off events. [2025-03-17 14:29:13,134 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2025-03-17 14:29:13,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16624 conditions, 7795 events. 5447/7795 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 43637 event pairs, 4350 based on Foata normal form. 0/7587 useless extension candidates. Maximal degree in co-relation 11183. Up to 7419 conditions per place. [2025-03-17 14:29:13,157 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 42 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-03-17 14:29:13,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 287 flow [2025-03-17 14:29:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-17 14:29:13,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2025-03-17 14:29:13,158 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 199 flow. Second operand 4 states and 110 transitions. [2025-03-17 14:29:13,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 287 flow [2025-03-17 14:29:13,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:13,160 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 198 flow [2025-03-17 14:29:13,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-03-17 14:29:13,160 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-03-17 14:29:13,161 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 198 flow [2025-03-17 14:29:13,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:13,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:13,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:13,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:29:13,361 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,SelfDestructingSolverStorable9 [2025-03-17 14:29:13,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1436382483, now seen corresponding path program 1 times [2025-03-17 14:29:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306410323] [2025-03-17 14:29:13,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:29:13,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:29:13,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:13,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:13,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306410323] [2025-03-17 14:29:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306410323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977235876] [2025-03-17 14:29:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:13,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:13,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:13,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-17 14:29:13,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 198 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-17 14:29:13,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:13,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-17 14:29:13,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:13,831 INFO L124 PetriNetUnfolderBase]: 7724/11151 cut-off events. [2025-03-17 14:29:13,832 INFO L125 PetriNetUnfolderBase]: For 1891/1891 co-relation queries the response was YES. [2025-03-17 14:29:13,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23790 conditions, 11151 events. 7724/11151 cut-off events. For 1891/1891 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 65229 event pairs, 3089 based on Foata normal form. 4/10967 useless extension candidates. Maximal degree in co-relation 16807. Up to 5496 conditions per place. [2025-03-17 14:29:13,869 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 65 selfloop transitions, 3 changer transitions 1/78 dead transitions. [2025-03-17 14:29:13,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 391 flow [2025-03-17 14:29:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-17 14:29:13,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-17 14:29:13,870 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 198 flow. Second operand 3 states and 112 transitions. [2025-03-17 14:29:13,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 391 flow [2025-03-17 14:29:13,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:13,873 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 212 flow [2025-03-17 14:29:13,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2025-03-17 14:29:13,873 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-17 14:29:13,874 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 212 flow [2025-03-17 14:29:13,874 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-17 14:29:13,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:13,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:13,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:29:13,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2094836606, now seen corresponding path program 1 times [2025-03-17 14:29:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338862228] [2025-03-17 14:29:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:13,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:29:13,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:29:13,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:13,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338862228] [2025-03-17 14:29:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338862228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:13,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:13,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:13,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982245891] [2025-03-17 14:29:13,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:13,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:13,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:13,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:13,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-17 14:29:13,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:13,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:13,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-17 14:29:13,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:14,490 INFO L124 PetriNetUnfolderBase]: 9078/13274 cut-off events. [2025-03-17 14:29:14,490 INFO L125 PetriNetUnfolderBase]: For 4919/4919 co-relation queries the response was YES. [2025-03-17 14:29:14,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29792 conditions, 13274 events. 9078/13274 cut-off events. For 4919/4919 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 80674 event pairs, 4479 based on Foata normal form. 162/13337 useless extension candidates. Maximal degree in co-relation 21783. Up to 6712 conditions per place. [2025-03-17 14:29:14,532 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 71 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-03-17 14:29:14,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 425 flow [2025-03-17 14:29:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-17 14:29:14,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2025-03-17 14:29:14,533 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 212 flow. Second operand 3 states and 113 transitions. [2025-03-17 14:29:14,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 425 flow [2025-03-17 14:29:14,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 421 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:14,535 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 225 flow [2025-03-17 14:29:14,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-17 14:29:14,535 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-17 14:29:14,535 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 225 flow [2025-03-17 14:29:14,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:14,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:14,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:29:14,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -649290546, now seen corresponding path program 1 times [2025-03-17 14:29:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-03-17 14:29:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:14,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:29:14,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:29:14,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:14,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-03-17 14:29:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190070091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151460879] [2025-03-17 14:29:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:14,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:14,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:14,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:14,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-17 14:29:14,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:14,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:14,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-17 14:29:14,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:15,277 INFO L124 PetriNetUnfolderBase]: 10319/15182 cut-off events. [2025-03-17 14:29:15,278 INFO L125 PetriNetUnfolderBase]: For 8333/8333 co-relation queries the response was YES. [2025-03-17 14:29:15,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34983 conditions, 15182 events. 10319/15182 cut-off events. For 8333/8333 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 93439 event pairs, 5028 based on Foata normal form. 297/15377 useless extension candidates. Maximal degree in co-relation 26569. Up to 7146 conditions per place. [2025-03-17 14:29:15,314 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 75 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-17 14:29:15,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 463 flow [2025-03-17 14:29:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-17 14:29:15,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-17 14:29:15,315 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 225 flow. Second operand 3 states and 115 transitions. [2025-03-17 14:29:15,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 463 flow [2025-03-17 14:29:15,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 448 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:15,318 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 233 flow [2025-03-17 14:29:15,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-17 14:29:15,318 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2025-03-17 14:29:15,319 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 233 flow [2025-03-17 14:29:15,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:15,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:15,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:15,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:29:15,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:15,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1967174795, now seen corresponding path program 1 times [2025-03-17 14:29:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-17 14:29:15,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:15,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:29:15,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:15,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:15,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-17 14:29:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:29:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273794913] [2025-03-17 14:29:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:15,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:29:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:15,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:29:15,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:29:15,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:15,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:15,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:15,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:15,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:16,799 INFO L124 PetriNetUnfolderBase]: 16199/23706 cut-off events. [2025-03-17 14:29:16,800 INFO L125 PetriNetUnfolderBase]: For 12282/12282 co-relation queries the response was YES. [2025-03-17 14:29:16,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55477 conditions, 23706 events. 16199/23706 cut-off events. For 12282/12282 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 153009 event pairs, 1776 based on Foata normal form. 756/23066 useless extension candidates. Maximal degree in co-relation 43220. Up to 9698 conditions per place. [2025-03-17 14:29:16,866 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 149 selfloop transitions, 14 changer transitions 8/179 dead transitions. [2025-03-17 14:29:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 179 transitions, 923 flow [2025-03-17 14:29:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:29:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:29:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 307 transitions. [2025-03-17 14:29:16,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5329861111111112 [2025-03-17 14:29:16,867 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 233 flow. Second operand 9 states and 307 transitions. [2025-03-17 14:29:16,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 179 transitions, 923 flow [2025-03-17 14:29:16,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 179 transitions, 904 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:16,873 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 347 flow [2025-03-17 14:29:16,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2025-03-17 14:29:16,873 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-03-17 14:29:16,873 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 347 flow [2025-03-17 14:29:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:16,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:16,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:16,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:29:16,874 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:16,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1767691117, now seen corresponding path program 2 times [2025-03-17 14:29:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:16,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097652294] [2025-03-17 14:29:16,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:16,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:29:16,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:16,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:16,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097652294] [2025-03-17 14:29:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097652294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:17,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:17,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344757915] [2025-03-17 14:29:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:17,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:17,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:17,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:17,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:17,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:17,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:17,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:17,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:18,841 INFO L124 PetriNetUnfolderBase]: 17509/25780 cut-off events. [2025-03-17 14:29:18,841 INFO L125 PetriNetUnfolderBase]: For 30352/30602 co-relation queries the response was YES. [2025-03-17 14:29:18,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70893 conditions, 25780 events. 17509/25780 cut-off events. For 30352/30602 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 171323 event pairs, 3125 based on Foata normal form. 246/24748 useless extension candidates. Maximal degree in co-relation 54067. Up to 18276 conditions per place. [2025-03-17 14:29:18,969 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 97 selfloop transitions, 12 changer transitions 32/150 dead transitions. [2025-03-17 14:29:18,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 150 transitions, 928 flow [2025-03-17 14:29:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:29:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:29:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2025-03-17 14:29:18,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-17 14:29:18,971 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 347 flow. Second operand 7 states and 232 transitions. [2025-03-17 14:29:18,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 150 transitions, 928 flow [2025-03-17 14:29:19,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 150 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:19,086 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 416 flow [2025-03-17 14:29:19,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2025-03-17 14:29:19,087 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 25 predicate places. [2025-03-17 14:29:19,087 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 416 flow [2025-03-17 14:29:19,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:19,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:19,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:19,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:29:19,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -358031287, now seen corresponding path program 3 times [2025-03-17 14:29:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676164234] [2025-03-17 14:29:19,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:29:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:19,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:29:19,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:19,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:29:19,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676164234] [2025-03-17 14:29:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676164234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:19,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:19,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024945763] [2025-03-17 14:29:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:19,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:19,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:19,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:19,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:19,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:19,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:19,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:19,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:21,429 INFO L124 PetriNetUnfolderBase]: 22636/33665 cut-off events. [2025-03-17 14:29:21,429 INFO L125 PetriNetUnfolderBase]: For 51346/51616 co-relation queries the response was YES. [2025-03-17 14:29:21,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102862 conditions, 33665 events. 22636/33665 cut-off events. For 51346/51616 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 236041 event pairs, 3997 based on Foata normal form. 402/34037 useless extension candidates. Maximal degree in co-relation 81326. Up to 18503 conditions per place. [2025-03-17 14:29:21,620 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 135 selfloop transitions, 48 changer transitions 15/207 dead transitions. [2025-03-17 14:29:21,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 1508 flow [2025-03-17 14:29:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:29:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:29:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 304 transitions. [2025-03-17 14:29:21,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-17 14:29:21,621 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 416 flow. Second operand 9 states and 304 transitions. [2025-03-17 14:29:21,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 1508 flow [2025-03-17 14:29:21,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 207 transitions, 1450 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:21,993 INFO L231 Difference]: Finished difference. Result has 101 places, 115 transitions, 921 flow [2025-03-17 14:29:21,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=921, PETRI_PLACES=101, PETRI_TRANSITIONS=115} [2025-03-17 14:29:21,993 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 35 predicate places. [2025-03-17 14:29:21,993 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 921 flow [2025-03-17 14:29:21,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:21,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:21,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:21,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:29:21,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:21,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2135005193, now seen corresponding path program 4 times [2025-03-17 14:29:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540131692] [2025-03-17 14:29:21,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:29:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:22,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:29:22,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:22,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:29:22,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540131692] [2025-03-17 14:29:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540131692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:22,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264693] [2025-03-17 14:29:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:22,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:22,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:22,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:22,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:22,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 921 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:22,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:22,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:22,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:24,992 INFO L124 PetriNetUnfolderBase]: 26730/40195 cut-off events. [2025-03-17 14:29:24,992 INFO L125 PetriNetUnfolderBase]: For 116821/116849 co-relation queries the response was YES. [2025-03-17 14:29:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144432 conditions, 40195 events. 26730/40195 cut-off events. For 116821/116849 co-relation queries the response was YES. Maximal size of possible extension queue 1684. Compared 297912 event pairs, 4529 based on Foata normal form. 232/40403 useless extension candidates. Maximal degree in co-relation 113280. Up to 25053 conditions per place. [2025-03-17 14:29:25,192 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 145 selfloop transitions, 86 changer transitions 9/249 dead transitions. [2025-03-17 14:29:25,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 249 transitions, 2508 flow [2025-03-17 14:29:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2025-03-17 14:29:25,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2025-03-17 14:29:25,194 INFO L175 Difference]: Start difference. First operand has 101 places, 115 transitions, 921 flow. Second operand 8 states and 258 transitions. [2025-03-17 14:29:25,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 249 transitions, 2508 flow [2025-03-17 14:29:25,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 249 transitions, 2462 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-17 14:29:25,653 INFO L231 Difference]: Finished difference. Result has 113 places, 167 transitions, 1836 flow [2025-03-17 14:29:25,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1836, PETRI_PLACES=113, PETRI_TRANSITIONS=167} [2025-03-17 14:29:25,653 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2025-03-17 14:29:25,653 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 167 transitions, 1836 flow [2025-03-17 14:29:25,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:25,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:25,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:29:25,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:25,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1821862093, now seen corresponding path program 5 times [2025-03-17 14:29:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:25,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731314033] [2025-03-17 14:29:25,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:29:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:25,661 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:29:25,669 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:25,669 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:25,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:25,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731314033] [2025-03-17 14:29:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731314033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340638096] [2025-03-17 14:29:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:25,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:25,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:25,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 167 transitions, 1836 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:25,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:25,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:30,003 INFO L124 PetriNetUnfolderBase]: 33067/49862 cut-off events. [2025-03-17 14:29:30,003 INFO L125 PetriNetUnfolderBase]: For 180089/180973 co-relation queries the response was YES. [2025-03-17 14:29:30,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196836 conditions, 49862 events. 33067/49862 cut-off events. For 180089/180973 co-relation queries the response was YES. Maximal size of possible extension queue 2233. Compared 380153 event pairs, 4946 based on Foata normal form. 416/49776 useless extension candidates. Maximal degree in co-relation 182233. Up to 27313 conditions per place. [2025-03-17 14:29:30,359 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 185 selfloop transitions, 130 changer transitions 16/339 dead transitions. [2025-03-17 14:29:30,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 339 transitions, 4108 flow [2025-03-17 14:29:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2025-03-17 14:29:30,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52734375 [2025-03-17 14:29:30,360 INFO L175 Difference]: Start difference. First operand has 113 places, 167 transitions, 1836 flow. Second operand 8 states and 270 transitions. [2025-03-17 14:29:30,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 339 transitions, 4108 flow [2025-03-17 14:29:31,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 339 transitions, 4092 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:31,932 INFO L231 Difference]: Finished difference. Result has 123 places, 224 transitions, 3152 flow [2025-03-17 14:29:31,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3152, PETRI_PLACES=123, PETRI_TRANSITIONS=224} [2025-03-17 14:29:31,933 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places. [2025-03-17 14:29:31,933 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 224 transitions, 3152 flow [2025-03-17 14:29:31,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:31,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:31,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:29:31,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2053472091, now seen corresponding path program 6 times [2025-03-17 14:29:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047887956] [2025-03-17 14:29:31,933 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:29:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:31,945 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:29:31,952 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:31,952 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 14:29:31,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047887956] [2025-03-17 14:29:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047887956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352759690] [2025-03-17 14:29:32,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:29:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:32,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:32,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:29:32,235 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:29:32,261 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:32,261 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 14:29:32,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:32,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:29:32,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:32,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:32,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-03-17 14:29:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74735963] [2025-03-17 14:29:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:32,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:29:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:32,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:29:32,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:29:32,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:32,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 224 transitions, 3152 flow. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:32,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:32,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:32,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:38,257 INFO L124 PetriNetUnfolderBase]: 37321/59084 cut-off events. [2025-03-17 14:29:38,257 INFO L125 PetriNetUnfolderBase]: For 248321/249129 co-relation queries the response was YES. [2025-03-17 14:29:38,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244076 conditions, 59084 events. 37321/59084 cut-off events. For 248321/249129 co-relation queries the response was YES. Maximal size of possible extension queue 2875. Compared 498511 event pairs, 4623 based on Foata normal form. 884/59544 useless extension candidates. Maximal degree in co-relation 228620. Up to 23380 conditions per place. [2025-03-17 14:29:38,820 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 243 selfloop transitions, 83 changer transitions 20/354 dead transitions. [2025-03-17 14:29:38,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 354 transitions, 4523 flow [2025-03-17 14:29:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2025-03-17 14:29:38,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2025-03-17 14:29:38,822 INFO L175 Difference]: Start difference. First operand has 123 places, 224 transitions, 3152 flow. Second operand 8 states and 284 transitions. [2025-03-17 14:29:38,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 354 transitions, 4523 flow [2025-03-17 14:29:42,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 354 transitions, 4505 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:42,531 INFO L231 Difference]: Finished difference. Result has 134 places, 228 transitions, 3445 flow [2025-03-17 14:29:42,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3137, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3445, PETRI_PLACES=134, PETRI_TRANSITIONS=228} [2025-03-17 14:29:42,532 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 68 predicate places. [2025-03-17 14:29:42,532 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 228 transitions, 3445 flow [2025-03-17 14:29:42,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:42,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:42,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:42,537 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-17 14:29:42,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:42,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1964135097, now seen corresponding path program 7 times [2025-03-17 14:29:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69443854] [2025-03-17 14:29:42,734 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:29:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:42,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:29:42,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:29:42,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:42,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:42,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69443854] [2025-03-17 14:29:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69443854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:42,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293880675] [2025-03-17 14:29:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:42,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:42,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:42,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-03-17 14:29:42,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 228 transitions, 3445 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:42,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:42,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-03-17 14:29:42,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:48,855 INFO L124 PetriNetUnfolderBase]: 39829/61294 cut-off events. [2025-03-17 14:29:48,855 INFO L125 PetriNetUnfolderBase]: For 335143/336075 co-relation queries the response was YES. [2025-03-17 14:29:49,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277930 conditions, 61294 events. 39829/61294 cut-off events. For 335143/336075 co-relation queries the response was YES. Maximal size of possible extension queue 2738. Compared 492266 event pairs, 6738 based on Foata normal form. 802/61644 useless extension candidates. Maximal degree in co-relation 245294. Up to 29992 conditions per place. [2025-03-17 14:29:49,318 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 239 selfloop transitions, 142 changer transitions 9/398 dead transitions. [2025-03-17 14:29:49,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 398 transitions, 5374 flow [2025-03-17 14:29:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:29:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:29:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 314 transitions. [2025-03-17 14:29:49,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5451388888888888 [2025-03-17 14:29:49,320 INFO L175 Difference]: Start difference. First operand has 134 places, 228 transitions, 3445 flow. Second operand 9 states and 314 transitions. [2025-03-17 14:29:49,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 398 transitions, 5374 flow