./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-array-int-subst.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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:06:10,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:06:10,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:06:10,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:06:10,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:06:10,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:06:10,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:06:10,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:06:10,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:06:10,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:06:10,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:06:10,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:06:10,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:06:10,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:06:10,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:06:10,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:06:10,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:06:10,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:06:10,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:10,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:06:10,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:06:10,918 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-03-04 10:06:11,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:06:11,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:06:11,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:06:11,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:06:11,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:06:11,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-04 10:06:12,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc959d79/ca704971c7b0443e820bc2f7d98887fa/FLAG6f697b90f [2025-03-04 10:06:12,422 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:06:12,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-04 10:06:12,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc959d79/ca704971c7b0443e820bc2f7d98887fa/FLAG6f697b90f [2025-03-04 10:06:12,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc959d79/ca704971c7b0443e820bc2f7d98887fa [2025-03-04 10:06:12,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:06:12,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:06:12,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:12,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:06:12,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:06:12,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63604a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12, skipping insertion in model container [2025-03-04 10:06:12,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:06:12,613 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:06:12,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:12,632 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:06:12,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:12,668 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:06:12,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12 WrapperNode [2025-03-04 10:06:12,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:12,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:12,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:06:12,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:06:12,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,696 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 258 [2025-03-04 10:06:12,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:12,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:06:12,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:06:12,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:06:12,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,718 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:06:12,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:06:12,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:06:12,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:06:12,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:06:12,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (1/1) ... [2025-03-04 10:06:12,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:12,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:06:12,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:06:12,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:06:12,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:06:12,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:06:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:06:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:06:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:06:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:06:12,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:06:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:06:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:06:12,783 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:06:12,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:06:12,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:06:13,278 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:06:13,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:06:13,498 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:06:13,499 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:06:13,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:13 BoogieIcfgContainer [2025-03-04 10:06:13,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:06:13,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:06:13,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:06:13,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:06:13,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:06:12" (1/3) ... [2025-03-04 10:06:13,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a8b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:13, skipping insertion in model container [2025-03-04 10:06:13,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:12" (2/3) ... [2025-03-04 10:06:13,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a8b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:13, skipping insertion in model container [2025-03-04 10:06:13,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:13" (3/3) ... [2025-03-04 10:06:13,508 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-04 10:06:13,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:06:13,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 79 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-04 10:06:13,521 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:06:13,582 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:06:13,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 195 flow [2025-03-04 10:06:13,638 INFO L124 PetriNetUnfolderBase]: 9/84 cut-off events. [2025-03-04 10:06:13,640 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:13,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 9/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 263 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-03-04 10:06:13,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 195 flow [2025-03-04 10:06:13,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 184 flow [2025-03-04 10:06:13,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:06:13,662 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;@2ec25814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:06:13,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-04 10:06:13,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:06:13,668 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:06:13,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:06:13,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:13,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:13,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:13,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 773747, now seen corresponding path program 1 times [2025-03-04 10:06:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632479988] [2025-03-04 10:06:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:13,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:13,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:13,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:13,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632479988] [2025-03-04 10:06:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632479988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:13,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:06:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505633170] [2025-03-04 10:06:13,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:13,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:06:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:13,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:06:13,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:06:13,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:13,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:13,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:13,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:13,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:14,182 INFO L124 PetriNetUnfolderBase]: 858/1703 cut-off events. [2025-03-04 10:06:14,182 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 10:06:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 1703 events. 858/1703 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10919 event pairs, 507 based on Foata normal form. 1/1149 useless extension candidates. Maximal degree in co-relation 2707. Up to 1158 conditions per place. [2025-03-04 10:06:14,198 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 33 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-04 10:06:14,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 244 flow [2025-03-04 10:06:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-04 10:06:14,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-03-04 10:06:14,209 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 184 flow. Second operand 3 states and 180 transitions. [2025-03-04 10:06:14,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 244 flow [2025-03-04 10:06:14,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:14,214 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-03-04 10:06:14,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-03-04 10:06:14,217 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-04 10:06:14,218 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-03-04 10:06:14,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:14,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:14,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:14,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:06:14,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash 773748, now seen corresponding path program 1 times [2025-03-04 10:06:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146258668] [2025-03-04 10:06:14,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:14,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:14,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:14,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:14,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:14,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146258668] [2025-03-04 10:06:14,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146258668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:14,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590620738] [2025-03-04 10:06:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:14,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:14,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:14,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:14,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:14,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:14,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:14,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:14,727 INFO L124 PetriNetUnfolderBase]: 859/1706 cut-off events. [2025-03-04 10:06:14,728 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 10:06:14,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 1706 events. 859/1706 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10902 event pairs, 507 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 2873. Up to 1171 conditions per place. [2025-03-04 10:06:14,737 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 37 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-04 10:06:14,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 81 transitions, 254 flow [2025-03-04 10:06:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2025-03-04 10:06:14,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2025-03-04 10:06:14,741 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 4 states and 230 transitions. [2025-03-04 10:06:14,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 81 transitions, 254 flow [2025-03-04 10:06:14,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:14,744 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 189 flow [2025-03-04 10:06:14,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2025-03-04 10:06:14,745 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2025-03-04 10:06:14,745 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 189 flow [2025-03-04 10:06:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:14,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:14,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:06:14,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:06:14,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:14,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 23988647, now seen corresponding path program 1 times [2025-03-04 10:06:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-03-04 10:06:14,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:14,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:06:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:06:14,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-03-04 10:06:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741556431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:14,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:14,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448999253] [2025-03-04 10:06:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:14,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:14,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:14,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:15,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:15,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:15,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:15,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:15,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:15,265 INFO L124 PetriNetUnfolderBase]: 860/1709 cut-off events. [2025-03-04 10:06:15,265 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 10:06:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1709 events. 860/1709 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10925 event pairs, 507 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 2902. Up to 1170 conditions per place. [2025-03-04 10:06:15,276 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 37 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-04 10:06:15,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 283 flow [2025-03-04 10:06:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-04 10:06:15,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2025-03-04 10:06:15,278 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 189 flow. Second operand 5 states and 280 transitions. [2025-03-04 10:06:15,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 283 flow [2025-03-04 10:06:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:15,279 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 223 flow [2025-03-04 10:06:15,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-03-04 10:06:15,280 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-03-04 10:06:15,280 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 223 flow [2025-03-04 10:06:15,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:15,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:15,280 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:06:15,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:06:15,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:15,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash 743595035, now seen corresponding path program 1 times [2025-03-04 10:06:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:15,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992250091] [2025-03-04 10:06:15,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:15,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:15,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:15,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:15,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:15,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:15,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:15,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992250091] [2025-03-04 10:06:15,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992250091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:15,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637601641] [2025-03-04 10:06:15,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:15,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:15,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:15,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:15,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:06:15,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:15,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:15,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:15,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:15,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:15,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:06:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:15,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637601641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:15,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:06:15,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672514256] [2025-03-04 10:06:15,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:15,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:15,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:15,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:15,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:16,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:16,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 223 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:16,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:16,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:16,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:16,521 INFO L124 PetriNetUnfolderBase]: 861/1711 cut-off events. [2025-03-04 10:06:16,521 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 10:06:16,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 1711 events. 861/1711 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10957 event pairs, 507 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2912. Up to 1169 conditions per place. [2025-03-04 10:06:16,530 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 34 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2025-03-04 10:06:16,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 326 flow [2025-03-04 10:06:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 468 transitions. [2025-03-04 10:06:16,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-03-04 10:06:16,532 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 223 flow. Second operand 9 states and 468 transitions. [2025-03-04 10:06:16,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 326 flow [2025-03-04 10:06:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 86 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:16,533 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 257 flow [2025-03-04 10:06:16,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2025-03-04 10:06:16,534 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-03-04 10:06:16,534 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 257 flow [2025-03-04 10:06:16,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:16,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:16,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:06:16,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:06:16,739 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-04 10:06:16,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:16,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 743650660, now seen corresponding path program 1 times [2025-03-04 10:06:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:16,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994566768] [2025-03-04 10:06:16,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:16,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:16,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:16,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:16,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:16,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994566768] [2025-03-04 10:06:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994566768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192849984] [2025-03-04 10:06:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:16,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:16,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:17,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:17,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:17,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:17,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:17,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:17,200 INFO L124 PetriNetUnfolderBase]: 862/1714 cut-off events. [2025-03-04 10:06:17,200 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 10:06:17,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 1714 events. 862/1714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10975 event pairs, 507 based on Foata normal form. 1/1160 useless extension candidates. Maximal degree in co-relation 2922. Up to 1175 conditions per place. [2025-03-04 10:06:17,208 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 40 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2025-03-04 10:06:17,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 361 flow [2025-03-04 10:06:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-03-04 10:06:17,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2025-03-04 10:06:17,210 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 257 flow. Second operand 5 states and 279 transitions. [2025-03-04 10:06:17,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 361 flow [2025-03-04 10:06:17,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 89 transitions, 312 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:06:17,212 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 251 flow [2025-03-04 10:06:17,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2025-03-04 10:06:17,213 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2025-03-04 10:06:17,213 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 251 flow [2025-03-04 10:06:17,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:17,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:17,213 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:06:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:06:17,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:17,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1578277477, now seen corresponding path program 1 times [2025-03-04 10:06:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-04 10:06:17,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:17,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:06:17,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:06:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-04 10:06:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2814990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950421339] [2025-03-04 10:06:17,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:17,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:17,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:06:17,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:06:17,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:06:17,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:17,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:17,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:06:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:17,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:06:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:17,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950421339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:17,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:06:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051212678] [2025-03-04 10:06:17,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:17,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:17,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:18,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:18,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 251 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:18,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:18,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:18,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:18,483 INFO L124 PetriNetUnfolderBase]: 862/1713 cut-off events. [2025-03-04 10:06:18,483 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:06:18,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 1713 events. 862/1713 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10923 event pairs, 507 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 2910. Up to 1165 conditions per place. [2025-03-04 10:06:18,495 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 33 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2025-03-04 10:06:18,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 88 transitions, 342 flow [2025-03-04 10:06:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 372 transitions. [2025-03-04 10:06:18,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108374384236454 [2025-03-04 10:06:18,497 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 251 flow. Second operand 7 states and 372 transitions. [2025-03-04 10:06:18,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 88 transitions, 342 flow [2025-03-04 10:06:18,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:18,499 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 269 flow [2025-03-04 10:06:18,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2025-03-04 10:06:18,499 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 6 predicate places. [2025-03-04 10:06:18,499 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 269 flow [2025-03-04 10:06:18,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:18,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:18,501 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:06:18,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:18,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:06:18,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:18,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1683738140, now seen corresponding path program 1 times [2025-03-04 10:06:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-03-04 10:06:18,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:18,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:06:18,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:06:18,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:18,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-03-04 10:06:18,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132718002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690194587] [2025-03-04 10:06:18,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:18,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:18,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:18,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:18,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:06:18,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:06:18,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:06:18,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:18,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:18,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:06:18,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:18,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:06:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:19,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690194587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:19,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:06:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541127614] [2025-03-04 10:06:19,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:19,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:19,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:19,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:19,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:19,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:19,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:19,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:19,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:20,064 INFO L124 PetriNetUnfolderBase]: 862/1712 cut-off events. [2025-03-04 10:06:20,064 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 10:06:20,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 1712 events. 862/1712 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10943 event pairs, 507 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 2911. Up to 1165 conditions per place. [2025-03-04 10:06:20,072 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 29 selfloop transitions, 18 changer transitions 0/87 dead transitions. [2025-03-04 10:06:20,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 358 flow [2025-03-04 10:06:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-03-04 10:06:20,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-03-04 10:06:20,073 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 269 flow. Second operand 7 states and 371 transitions. [2025-03-04 10:06:20,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 358 flow [2025-03-04 10:06:20,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 331 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:20,075 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 273 flow [2025-03-04 10:06:20,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2025-03-04 10:06:20,075 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-03-04 10:06:20,075 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 273 flow [2025-03-04 10:06:20,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:20,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:20,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:20,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:20,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:20,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:20,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 659780268, now seen corresponding path program 1 times [2025-03-04 10:06:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138250168] [2025-03-04 10:06:20,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:20,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:06:20,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:06:20,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:20,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:20,334 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-04 10:06:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138250168] [2025-03-04 10:06:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138250168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409204741] [2025-03-04 10:06:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:20,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:20,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:20,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:20,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:20,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:20,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:20,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:20,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:20,590 INFO L124 PetriNetUnfolderBase]: 1468/3122 cut-off events. [2025-03-04 10:06:20,591 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 10:06:20,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 3122 events. 1468/3122 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23502 event pairs, 761 based on Foata normal form. 62/2206 useless extension candidates. Maximal degree in co-relation 3515. Up to 1335 conditions per place. [2025-03-04 10:06:20,602 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 89 selfloop transitions, 8 changer transitions 0/136 dead transitions. [2025-03-04 10:06:20,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 136 transitions, 619 flow [2025-03-04 10:06:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 383 transitions. [2025-03-04 10:06:20,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7337164750957854 [2025-03-04 10:06:20,605 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 273 flow. Second operand 6 states and 383 transitions. [2025-03-04 10:06:20,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 136 transitions, 619 flow [2025-03-04 10:06:20,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 561 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:20,608 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 294 flow [2025-03-04 10:06:20,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2025-03-04 10:06:20,609 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2025-03-04 10:06:20,609 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 294 flow [2025-03-04 10:06:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:20,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:20,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:06:20,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:20,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1863734629, now seen corresponding path program 1 times [2025-03-04 10:06:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-04 10:06:20,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:20,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:06:20,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:06:20,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:20,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-04 10:06:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897465717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:20,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:20,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146685224] [2025-03-04 10:06:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:20,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:20,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:20,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:20,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:20,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:20,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:20,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:20,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:20,975 INFO L124 PetriNetUnfolderBase]: 2407/4967 cut-off events. [2025-03-04 10:06:20,976 INFO L125 PetriNetUnfolderBase]: For 519/519 co-relation queries the response was YES. [2025-03-04 10:06:20,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8883 conditions, 4967 events. 2407/4967 cut-off events. For 519/519 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 40009 event pairs, 1023 based on Foata normal form. 62/3594 useless extension candidates. Maximal degree in co-relation 5334. Up to 1986 conditions per place. [2025-03-04 10:06:20,993 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 91 selfloop transitions, 8 changer transitions 0/138 dead transitions. [2025-03-04 10:06:20,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 623 flow [2025-03-04 10:06:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2025-03-04 10:06:20,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2025-03-04 10:06:20,995 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 294 flow. Second operand 5 states and 325 transitions. [2025-03-04 10:06:20,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 623 flow [2025-03-04 10:06:20,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 138 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:20,997 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 326 flow [2025-03-04 10:06:20,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2025-03-04 10:06:20,998 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2025-03-04 10:06:20,998 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 326 flow [2025-03-04 10:06:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:20,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:20,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:06:20,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1672955780, now seen corresponding path program 1 times [2025-03-04 10:06:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016962060] [2025-03-04 10:06:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:06:21,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:06:21,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:21,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:21,045 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-04 10:06:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016962060] [2025-03-04 10:06:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016962060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613290745] [2025-03-04 10:06:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:21,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:21,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:21,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:21,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:21,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:21,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:21,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:21,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:21,328 INFO L124 PetriNetUnfolderBase]: 1964/4486 cut-off events. [2025-03-04 10:06:21,328 INFO L125 PetriNetUnfolderBase]: For 1186/1186 co-relation queries the response was YES. [2025-03-04 10:06:21,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8025 conditions, 4486 events. 1964/4486 cut-off events. For 1186/1186 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 37595 event pairs, 1066 based on Foata normal form. 82/3180 useless extension candidates. Maximal degree in co-relation 4951. Up to 2079 conditions per place. [2025-03-04 10:06:21,346 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 89 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 10:06:21,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 132 transitions, 629 flow [2025-03-04 10:06:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-03-04 10:06:21,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2025-03-04 10:06:21,347 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 326 flow. Second operand 5 states and 321 transitions. [2025-03-04 10:06:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 132 transitions, 629 flow [2025-03-04 10:06:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 132 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:21,350 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 338 flow [2025-03-04 10:06:21,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-03-04 10:06:21,352 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2025-03-04 10:06:21,352 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 338 flow [2025-03-04 10:06:21,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:21,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:21,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:06:21,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:21,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1463659686, now seen corresponding path program 1 times [2025-03-04 10:06:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101780352] [2025-03-04 10:06:21,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:21,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:21,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:21,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101780352] [2025-03-04 10:06:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101780352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:21,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442365] [2025-03-04 10:06:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:21,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:21,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:21,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:21,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:21,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:21,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:21,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:21,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:21,687 INFO L124 PetriNetUnfolderBase]: 1650/3680 cut-off events. [2025-03-04 10:06:21,687 INFO L125 PetriNetUnfolderBase]: For 1250/1250 co-relation queries the response was YES. [2025-03-04 10:06:21,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 3680 events. 1650/3680 cut-off events. For 1250/1250 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 29304 event pairs, 938 based on Foata normal form. 58/2733 useless extension candidates. Maximal degree in co-relation 5033. Up to 1786 conditions per place. [2025-03-04 10:06:21,701 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 88 selfloop transitions, 7 changer transitions 0/134 dead transitions. [2025-03-04 10:06:21,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 134 transitions, 665 flow [2025-03-04 10:06:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 317 transitions. [2025-03-04 10:06:21,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.728735632183908 [2025-03-04 10:06:21,703 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 338 flow. Second operand 5 states and 317 transitions. [2025-03-04 10:06:21,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 134 transitions, 665 flow [2025-03-04 10:06:21,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:21,705 INFO L231 Difference]: Finished difference. Result has 104 places, 96 transitions, 356 flow [2025-03-04 10:06:21,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=104, PETRI_TRANSITIONS=96} [2025-03-04 10:06:21,707 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2025-03-04 10:06:21,707 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 96 transitions, 356 flow [2025-03-04 10:06:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:21,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:21,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:21,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:06:21,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:21,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -331707165, now seen corresponding path program 1 times [2025-03-04 10:06:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:21,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-04 10:06:21,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:21,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:21,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:21,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:21,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:06:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:21,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-04 10:06:21,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307157604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:21,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:21,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061331774] [2025-03-04 10:06:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:21,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:21,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:21,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:21,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-04 10:06:21,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 96 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 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-04 10:06:21,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:21,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-04 10:06:21,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:22,131 INFO L124 PetriNetUnfolderBase]: 2252/4810 cut-off events. [2025-03-04 10:06:22,131 INFO L125 PetriNetUnfolderBase]: For 1614/1614 co-relation queries the response was YES. [2025-03-04 10:06:22,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 4810 events. 2252/4810 cut-off events. For 1614/1614 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 38115 event pairs, 1604 based on Foata normal form. 0/3667 useless extension candidates. Maximal degree in co-relation 5855. Up to 3202 conditions per place. [2025-03-04 10:06:22,145 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 53 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2025-03-04 10:06:22,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 92 transitions, 468 flow [2025-03-04 10:06:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2025-03-04 10:06:22,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5471264367816092 [2025-03-04 10:06:22,147 INFO L175 Difference]: Start difference. First operand has 104 places, 96 transitions, 356 flow. Second operand 5 states and 238 transitions. [2025-03-04 10:06:22,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 92 transitions, 468 flow [2025-03-04 10:06:22,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 92 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:22,149 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 351 flow [2025-03-04 10:06:22,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2025-03-04 10:06:22,150 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 18 predicate places. [2025-03-04 10:06:22,150 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 351 flow [2025-03-04 10:06:22,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 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-04 10:06:22,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:22,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:22,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:06:22,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash -19017483, now seen corresponding path program 1 times [2025-03-04 10:06:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802546258] [2025-03-04 10:06:22,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:22,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:22,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:22,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:22,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:22,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802546258] [2025-03-04 10:06:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802546258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:22,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:22,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013887822] [2025-03-04 10:06:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:22,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:22,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:22,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:22,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:22,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:22,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:22,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:22,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:22,597 INFO L124 PetriNetUnfolderBase]: 2525/5673 cut-off events. [2025-03-04 10:06:22,598 INFO L125 PetriNetUnfolderBase]: For 2740/2740 co-relation queries the response was YES. [2025-03-04 10:06:22,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11438 conditions, 5673 events. 2525/5673 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 48269 event pairs, 1319 based on Foata normal form. 92/4402 useless extension candidates. Maximal degree in co-relation 6427. Up to 2320 conditions per place. [2025-03-04 10:06:22,617 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 93 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2025-03-04 10:06:22,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 137 transitions, 719 flow [2025-03-04 10:06:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-03-04 10:06:22,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2025-03-04 10:06:22,618 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 351 flow. Second operand 5 states and 321 transitions. [2025-03-04 10:06:22,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 137 transitions, 719 flow [2025-03-04 10:06:22,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 137 transitions, 708 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:22,622 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 380 flow [2025-03-04 10:06:22,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2025-03-04 10:06:22,623 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 21 predicate places. [2025-03-04 10:06:22,623 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 380 flow [2025-03-04 10:06:22,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:22,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:22,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:22,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:06:22,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:22,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:22,623 INFO L85 PathProgramCache]: Analyzing trace with hash -331707164, now seen corresponding path program 1 times [2025-03-04 10:06:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:22,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-03-04 10:06:22,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:22,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:22,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:22,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:22,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:22,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-03-04 10:06:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849027466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950756697] [2025-03-04 10:06:22,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:22,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:22,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:06:22,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:22,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:22,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:22,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:22,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:22,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:22,872 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 6 treesize of output 5 [2025-03-04 10:06:22,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:06:22,925 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:06:22,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:06:22,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:22,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:06:22,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:22,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:22,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:23,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2025-03-04 10:06:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950756697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:23,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:06:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298574078] [2025-03-04 10:06:23,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:23,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:23,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:23,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:24,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-03-04 10:06:24,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 380 flow. Second operand has 13 states, 13 states have (on average 37.84615384615385) internal successors, (492), 13 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:24,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:24,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-03-04 10:06:24,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:25,561 INFO L124 PetriNetUnfolderBase]: 6653/12408 cut-off events. [2025-03-04 10:06:25,562 INFO L125 PetriNetUnfolderBase]: For 5551/5551 co-relation queries the response was YES. [2025-03-04 10:06:25,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25664 conditions, 12408 events. 6653/12408 cut-off events. For 5551/5551 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 100461 event pairs, 2298 based on Foata normal form. 0/9977 useless extension candidates. Maximal degree in co-relation 19237. Up to 3760 conditions per place. [2025-03-04 10:06:25,603 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 125 selfloop transitions, 19 changer transitions 0/173 dead transitions. [2025-03-04 10:06:25,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 900 flow [2025-03-04 10:06:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 459 transitions. [2025-03-04 10:06:25,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-04 10:06:25,605 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 380 flow. Second operand 9 states and 459 transitions. [2025-03-04 10:06:25,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 900 flow [2025-03-04 10:06:25,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 173 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:25,610 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 433 flow [2025-03-04 10:06:25,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=433, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2025-03-04 10:06:25,610 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 29 predicate places. [2025-03-04 10:06:25,610 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 433 flow [2025-03-04 10:06:25,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.84615384615385) internal successors, (492), 13 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:25,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:25,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:25,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:06:25,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:25,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:25,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1692986775, now seen corresponding path program 1 times [2025-03-04 10:06:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:25,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-04 10:06:25,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:25,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:06:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:06:25,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:25,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-04 10:06:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372854327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490142095] [2025-03-04 10:06:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:25,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:25,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-03-04 10:06:25,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:25,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:25,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-03-04 10:06:25,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,581 INFO L124 PetriNetUnfolderBase]: 5449/10661 cut-off events. [2025-03-04 10:06:26,581 INFO L125 PetriNetUnfolderBase]: For 7663/7663 co-relation queries the response was YES. [2025-03-04 10:06:26,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23298 conditions, 10661 events. 5449/10661 cut-off events. For 7663/7663 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 88478 event pairs, 4173 based on Foata normal form. 0/9243 useless extension candidates. Maximal degree in co-relation 16733. Up to 7877 conditions per place. [2025-03-04 10:06:26,626 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 55 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-03-04 10:06:26,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 92 transitions, 551 flow [2025-03-04 10:06:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2025-03-04 10:06:26,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5563218390804597 [2025-03-04 10:06:26,628 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 433 flow. Second operand 5 states and 242 transitions. [2025-03-04 10:06:26,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 92 transitions, 551 flow [2025-03-04 10:06:26,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 92 transitions, 519 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:26,634 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 409 flow [2025-03-04 10:06:26,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2025-03-04 10:06:26,635 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 25 predicate places. [2025-03-04 10:06:26,635 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 409 flow [2025-03-04 10:06:26,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:26,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:26,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:06:26,635 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1692986774, now seen corresponding path program 1 times [2025-03-04 10:06:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189257145] [2025-03-04 10:06:26,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:26,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:06:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:06:26,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189257145] [2025-03-04 10:06:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189257145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117787064] [2025-03-04 10:06:26,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:26,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:26,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:06:26,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:06:26,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:06:26,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:06:26,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:26,852 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 6 treesize of output 5 [2025-03-04 10:06:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:26,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:06:26,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:26,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:26,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:27,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:06:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117787064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:27,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:27,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:06:27,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737804021] [2025-03-04 10:06:27,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:27,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:27,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:27,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:27,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-03-04 10:06:27,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 409 flow. Second operand has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:27,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:27,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-03-04 10:06:27,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:28,397 INFO L124 PetriNetUnfolderBase]: 4394/8078 cut-off events. [2025-03-04 10:06:28,397 INFO L125 PetriNetUnfolderBase]: For 5672/5672 co-relation queries the response was YES. [2025-03-04 10:06:28,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18166 conditions, 8078 events. 4394/8078 cut-off events. For 5672/5672 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 60720 event pairs, 1341 based on Foata normal form. 0/6971 useless extension candidates. Maximal degree in co-relation 12464. Up to 2286 conditions per place. [2025-03-04 10:06:28,423 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 113 selfloop transitions, 25 changer transitions 0/167 dead transitions. [2025-03-04 10:06:28,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 167 transitions, 961 flow [2025-03-04 10:06:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 514 transitions. [2025-03-04 10:06:28,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6564495530012772 [2025-03-04 10:06:28,424 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 409 flow. Second operand 9 states and 514 transitions. [2025-03-04 10:06:28,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 167 transitions, 961 flow [2025-03-04 10:06:28,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 167 transitions, 945 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:28,431 INFO L231 Difference]: Finished difference. Result has 115 places, 98 transitions, 513 flow [2025-03-04 10:06:28,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=513, PETRI_PLACES=115, PETRI_TRANSITIONS=98} [2025-03-04 10:06:28,431 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 31 predicate places. [2025-03-04 10:06:28,431 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 98 transitions, 513 flow [2025-03-04 10:06:28,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:28,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:28,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:28,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:28,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:06:28,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:28,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1432271335, now seen corresponding path program 1 times [2025-03-04 10:06:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-04 10:06:28,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:28,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:06:28,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:06:28,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:28,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-04 10:06:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333806463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931406440] [2025-03-04 10:06:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:28,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:28,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:28,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:28,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:28,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 98 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:28,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:28,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:28,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:29,093 INFO L124 PetriNetUnfolderBase]: 3473/6989 cut-off events. [2025-03-04 10:06:29,093 INFO L125 PetriNetUnfolderBase]: For 7209/7245 co-relation queries the response was YES. [2025-03-04 10:06:29,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16165 conditions, 6989 events. 3473/6989 cut-off events. For 7209/7245 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 55032 event pairs, 2143 based on Foata normal form. 94/5959 useless extension candidates. Maximal degree in co-relation 10564. Up to 3728 conditions per place. [2025-03-04 10:06:29,112 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 92 selfloop transitions, 13 changer transitions 0/136 dead transitions. [2025-03-04 10:06:29,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 136 transitions, 923 flow [2025-03-04 10:06:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-03-04 10:06:29,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7218390804597701 [2025-03-04 10:06:29,114 INFO L175 Difference]: Start difference. First operand has 115 places, 98 transitions, 513 flow. Second operand 5 states and 314 transitions. [2025-03-04 10:06:29,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 136 transitions, 923 flow [2025-03-04 10:06:29,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 136 transitions, 895 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:29,118 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 549 flow [2025-03-04 10:06:29,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2025-03-04 10:06:29,119 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 34 predicate places. [2025-03-04 10:06:29,119 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 549 flow [2025-03-04 10:06:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:29,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:29,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:29,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:06:29,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -712265475, now seen corresponding path program 1 times [2025-03-04 10:06:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-04 10:06:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:06:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:06:29,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:29,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-04 10:06:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924394248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305941818] [2025-03-04 10:06:29,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:29,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:29,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:29,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:06:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:06:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:06:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:29,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:29,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:29,353 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 6 treesize of output 5 [2025-03-04 10:06:29,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:29,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:06:29,397 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:06:29,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:06:29,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:29,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:06:29,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:29,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:29,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:29,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2025-03-04 10:06:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305941818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:29,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-04 10:06:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838722956] [2025-03-04 10:06:29,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:29,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:06:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:29,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:06:29,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:06:30,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-03-04 10:06:30,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 100 transitions, 549 flow. Second operand has 15 states, 15 states have (on average 38.8) internal successors, (582), 15 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:30,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:30,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-03-04 10:06:30,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:32,094 INFO L124 PetriNetUnfolderBase]: 8895/16763 cut-off events. [2025-03-04 10:06:32,094 INFO L125 PetriNetUnfolderBase]: For 13977/14153 co-relation queries the response was YES. [2025-03-04 10:06:32,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36863 conditions, 16763 events. 8895/16763 cut-off events. For 13977/14153 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 141470 event pairs, 2286 based on Foata normal form. 0/13862 useless extension candidates. Maximal degree in co-relation 29214. Up to 4948 conditions per place. [2025-03-04 10:06:32,148 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 131 selfloop transitions, 25 changer transitions 0/181 dead transitions. [2025-03-04 10:06:32,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 181 transitions, 1181 flow [2025-03-04 10:06:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 461 transitions. [2025-03-04 10:06:32,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5887611749680716 [2025-03-04 10:06:32,150 INFO L175 Difference]: Start difference. First operand has 118 places, 100 transitions, 549 flow. Second operand 9 states and 461 transitions. [2025-03-04 10:06:32,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 181 transitions, 1181 flow [2025-03-04 10:06:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 181 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:32,158 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 599 flow [2025-03-04 10:06:32,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=599, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2025-03-04 10:06:32,158 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 41 predicate places. [2025-03-04 10:06:32,158 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 599 flow [2025-03-04 10:06:32,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 38.8) internal successors, (582), 15 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:32,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:32,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:32,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:32,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:06:32,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:32,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -605392509, now seen corresponding path program 1 times [2025-03-04 10:06:32,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209315122] [2025-03-04 10:06:32,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:06:32,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:06:32,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209315122] [2025-03-04 10:06:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209315122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321886817] [2025-03-04 10:06:32,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:32,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:32,469 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:32,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:06:32,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:06:32,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:06:32,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:32,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:06:32,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:32,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:32,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:06:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321886817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:32,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:06:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523531740] [2025-03-04 10:06:32,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:32,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:32,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:32,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:32,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:32,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 599 flow. Second operand has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:32,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:32,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:33,698 INFO L124 PetriNetUnfolderBase]: 6137/11675 cut-off events. [2025-03-04 10:06:33,698 INFO L125 PetriNetUnfolderBase]: For 13552/13744 co-relation queries the response was YES. [2025-03-04 10:06:33,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27812 conditions, 11675 events. 6137/11675 cut-off events. For 13552/13744 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 94692 event pairs, 2012 based on Foata normal form. 0/10574 useless extension candidates. Maximal degree in co-relation 20338. Up to 2957 conditions per place. [2025-03-04 10:06:33,735 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 114 selfloop transitions, 25 changer transitions 0/168 dead transitions. [2025-03-04 10:06:33,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 1155 flow [2025-03-04 10:06:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 437 transitions. [2025-03-04 10:06:33,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7175697865353038 [2025-03-04 10:06:33,736 INFO L175 Difference]: Start difference. First operand has 125 places, 101 transitions, 599 flow. Second operand 7 states and 437 transitions. [2025-03-04 10:06:33,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 1155 flow [2025-03-04 10:06:33,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 168 transitions, 1112 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:33,746 INFO L231 Difference]: Finished difference. Result has 126 places, 101 transitions, 622 flow [2025-03-04 10:06:33,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=622, PETRI_PLACES=126, PETRI_TRANSITIONS=101} [2025-03-04 10:06:33,747 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 42 predicate places. [2025-03-04 10:06:33,747 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 101 transitions, 622 flow [2025-03-04 10:06:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:33,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:33,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:33,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:33,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:33,947 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash -605392510, now seen corresponding path program 1 times [2025-03-04 10:06:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603397263] [2025-03-04 10:06:33,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:33,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:33,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:06:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:06:33,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:33,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603397263] [2025-03-04 10:06:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603397263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321100360] [2025-03-04 10:06:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:33,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:33,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:34,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 87 [2025-03-04 10:06:34,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 101 transitions, 622 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:34,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:34,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 87 [2025-03-04 10:06:34,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:34,673 INFO L124 PetriNetUnfolderBase]: 6677/12666 cut-off events. [2025-03-04 10:06:34,673 INFO L125 PetriNetUnfolderBase]: For 17158/17434 co-relation queries the response was YES. [2025-03-04 10:06:34,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31214 conditions, 12666 events. 6677/12666 cut-off events. For 17158/17434 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 103267 event pairs, 5305 based on Foata normal form. 304/12009 useless extension candidates. Maximal degree in co-relation 23613. Up to 9653 conditions per place. [2025-03-04 10:06:34,710 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 63 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2025-03-04 10:06:34,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 97 transitions, 758 flow [2025-03-04 10:06:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-03-04 10:06:34,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2025-03-04 10:06:34,711 INFO L175 Difference]: Start difference. First operand has 126 places, 101 transitions, 622 flow. Second operand 4 states and 205 transitions. [2025-03-04 10:06:34,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 97 transitions, 758 flow [2025-03-04 10:06:34,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 97 transitions, 710 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:34,719 INFO L231 Difference]: Finished difference. Result has 120 places, 97 transitions, 584 flow [2025-03-04 10:06:34,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=584, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2025-03-04 10:06:34,720 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 36 predicate places. [2025-03-04 10:06:34,720 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 584 flow [2025-03-04 10:06:34,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:34,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:34,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:06:34,720 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:34,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 975451873, now seen corresponding path program 1 times [2025-03-04 10:06:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087333331] [2025-03-04 10:06:34,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:06:34,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:06:34,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:34,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087333331] [2025-03-04 10:06:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087333331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:34,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407292550] [2025-03-04 10:06:34,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:34,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:34,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:34,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:06:34,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:06:34,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:06:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:06:34,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:34,889 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 6 treesize of output 5 [2025-03-04 10:06:34,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:34,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:06:34,920 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:34,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:34,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:35,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:06:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407292550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:35,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:06:35,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122729135] [2025-03-04 10:06:35,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:35,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:35,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:35,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:35,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 87 [2025-03-04 10:06:35,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 584 flow. Second operand has 13 states, 13 states have (on average 45.69230769230769) internal successors, (594), 13 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:35,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:35,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 87 [2025-03-04 10:06:35,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:36,729 INFO L124 PetriNetUnfolderBase]: 11162/19771 cut-off events. [2025-03-04 10:06:36,730 INFO L125 PetriNetUnfolderBase]: For 27163/28262 co-relation queries the response was YES. [2025-03-04 10:06:36,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47772 conditions, 19771 events. 11162/19771 cut-off events. For 27163/28262 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 163067 event pairs, 3348 based on Foata normal form. 0/18176 useless extension candidates. Maximal degree in co-relation 39239. Up to 5473 conditions per place. [2025-03-04 10:06:36,813 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 118 selfloop transitions, 25 changer transitions 0/167 dead transitions. [2025-03-04 10:06:36,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 167 transitions, 1194 flow [2025-03-04 10:06:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 499 transitions. [2025-03-04 10:06:36,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6372924648786717 [2025-03-04 10:06:36,814 INFO L175 Difference]: Start difference. First operand has 120 places, 97 transitions, 584 flow. Second operand 9 states and 499 transitions. [2025-03-04 10:06:36,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 167 transitions, 1194 flow [2025-03-04 10:06:36,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 167 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:36,826 INFO L231 Difference]: Finished difference. Result has 127 places, 98 transitions, 642 flow [2025-03-04 10:06:36,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=642, PETRI_PLACES=127, PETRI_TRANSITIONS=98} [2025-03-04 10:06:36,826 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 43 predicate places. [2025-03-04 10:06:36,827 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 98 transitions, 642 flow [2025-03-04 10:06:36,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.69230769230769) internal successors, (594), 13 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:36,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:36,827 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:36,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:37,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:06:37,027 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 32689322, now seen corresponding path program 1 times [2025-03-04 10:06:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:37,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814029216] [2025-03-04 10:06:37,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:37,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:06:37,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:06:37,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:37,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814029216] [2025-03-04 10:06:37,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814029216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072648300] [2025-03-04 10:06:37,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:37,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:37,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:37,088 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:37,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:06:37,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:06:37,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:06:37,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:37,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:37,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:06:37,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:37,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072648300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:37,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:37,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 10:06:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272301010] [2025-03-04 10:06:37,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:06:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:37,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:06:37,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:37,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:37,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 98 transitions, 642 flow. Second operand has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:37,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:37,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:37,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:40,794 INFO L124 PetriNetUnfolderBase]: 26258/47584 cut-off events. [2025-03-04 10:06:40,794 INFO L125 PetriNetUnfolderBase]: For 79606/82690 co-relation queries the response was YES. [2025-03-04 10:06:40,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121987 conditions, 47584 events. 26258/47584 cut-off events. For 79606/82690 co-relation queries the response was YES. Maximal size of possible extension queue 1898. Compared 458240 event pairs, 11022 based on Foata normal form. 744/46461 useless extension candidates. Maximal degree in co-relation 49206. Up to 11075 conditions per place. [2025-03-04 10:06:41,023 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 299 selfloop transitions, 48 changer transitions 0/374 dead transitions. [2025-03-04 10:06:41,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 374 transitions, 2888 flow [2025-03-04 10:06:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:06:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:06:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1436 transitions. [2025-03-04 10:06:41,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6877394636015326 [2025-03-04 10:06:41,025 INFO L175 Difference]: Start difference. First operand has 127 places, 98 transitions, 642 flow. Second operand 24 states and 1436 transitions. [2025-03-04 10:06:41,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 374 transitions, 2888 flow [2025-03-04 10:06:41,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 374 transitions, 2767 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:41,085 INFO L231 Difference]: Finished difference. Result has 154 places, 131 transitions, 1020 flow [2025-03-04 10:06:41,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1020, PETRI_PLACES=154, PETRI_TRANSITIONS=131} [2025-03-04 10:06:41,086 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 70 predicate places. [2025-03-04 10:06:41,086 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 131 transitions, 1020 flow [2025-03-04 10:06:41,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:41,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:41,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:41,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:41,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:41,287 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:41,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash 174237745, now seen corresponding path program 1 times [2025-03-04 10:06:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:41,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-03-04 10:06:41,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:41,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:06:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:06:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-03-04 10:06:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041347968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352759690] [2025-03-04 10:06:41,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:41,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:41,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:06:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:06:41,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:06:41,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:41,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:41,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:06:41,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:41,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:41,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:06:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352759690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:41,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:06:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831089858] [2025-03-04 10:06:41,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:41,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:41,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:41,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:41,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-04 10:06:41,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 131 transitions, 1020 flow. Second operand has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:41,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:41,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-04 10:06:41,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:45,665 INFO L124 PetriNetUnfolderBase]: 28254/48779 cut-off events. [2025-03-04 10:06:45,665 INFO L125 PetriNetUnfolderBase]: For 102010/106758 co-relation queries the response was YES. [2025-03-04 10:06:45,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129105 conditions, 48779 events. 28254/48779 cut-off events. For 102010/106758 co-relation queries the response was YES. Maximal size of possible extension queue 1971. Compared 450946 event pairs, 9287 based on Foata normal form. 0/47259 useless extension candidates. Maximal degree in co-relation 128356. Up to 13215 conditions per place. [2025-03-04 10:06:45,971 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 161 selfloop transitions, 33 changer transitions 0/219 dead transitions. [2025-03-04 10:06:45,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 219 transitions, 2027 flow [2025-03-04 10:06:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 433 transitions. [2025-03-04 10:06:45,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7110016420361248 [2025-03-04 10:06:45,973 INFO L175 Difference]: Start difference. First operand has 154 places, 131 transitions, 1020 flow. Second operand 7 states and 433 transitions. [2025-03-04 10:06:45,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 219 transitions, 2027 flow [2025-03-04 10:06:46,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 219 transitions, 2012 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:46,035 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 1088 flow [2025-03-04 10:06:46,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1088, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2025-03-04 10:06:46,035 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 74 predicate places. [2025-03-04 10:06:46,035 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 1088 flow [2025-03-04 10:06:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:46,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:46,036 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:46,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:46,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:06:46,236 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:46,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash -679825213, now seen corresponding path program 1 times [2025-03-04 10:06:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605162295] [2025-03-04 10:06:46,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:46,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:06:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:06:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:46,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:46,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605162295] [2025-03-04 10:06:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605162295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:46,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179295614] [2025-03-04 10:06:46,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:46,308 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:46,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:06:46,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:06:46,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:06:46,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:46,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:46,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:06:46,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:46,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:46,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179295614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:46,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-04 10:06:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288348] [2025-03-04 10:06:46,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:46,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:06:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:46,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:06:46,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:46,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:46,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 1088 flow. Second operand has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:46,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:46,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:46,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:52,958 INFO L124 PetriNetUnfolderBase]: 39161/70421 cut-off events. [2025-03-04 10:06:52,958 INFO L125 PetriNetUnfolderBase]: For 162459/168084 co-relation queries the response was YES. [2025-03-04 10:06:53,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195098 conditions, 70421 events. 39161/70421 cut-off events. For 162459/168084 co-relation queries the response was YES. Maximal size of possible extension queue 2824. Compared 709206 event pairs, 14685 based on Foata normal form. 1201/69428 useless extension candidates. Maximal degree in co-relation 193576. Up to 18330 conditions per place. [2025-03-04 10:06:53,557 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 282 selfloop transitions, 73 changer transitions 0/382 dead transitions. [2025-03-04 10:06:53,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 382 transitions, 3461 flow [2025-03-04 10:06:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:06:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:06:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1266 transitions. [2025-03-04 10:06:53,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929392446633826 [2025-03-04 10:06:53,558 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 1088 flow. Second operand 21 states and 1266 transitions. [2025-03-04 10:06:53,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 382 transitions, 3461 flow [2025-03-04 10:06:53,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 382 transitions, 3332 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:53,866 INFO L231 Difference]: Finished difference. Result has 180 places, 154 transitions, 1526 flow [2025-03-04 10:06:53,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1526, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2025-03-04 10:06:53,866 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 96 predicate places. [2025-03-04 10:06:53,866 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 1526 flow [2025-03-04 10:06:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:53,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:53,867 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:53,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:06:54,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:06:54,067 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:06:54,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1898047193, now seen corresponding path program 1 times [2025-03-04 10:06:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:54,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896149968] [2025-03-04 10:06:54,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:54,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896149968] [2025-03-04 10:06:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896149968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531105533] [2025-03-04 10:06:54,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:54,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:54,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:54,128 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:54,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:06:54,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:54,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:54,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:54,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:06:54,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:54,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531105533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:54,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:54,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 10:06:54,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697245483] [2025-03-04 10:06:54,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:54,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:06:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:54,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:06:54,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:54,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-04 10:06:54,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 1526 flow. Second operand has 16 states, 16 states have (on average 51.5625) internal successors, (825), 16 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:54,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:54,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-04 10:06:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:59,748 INFO L124 PetriNetUnfolderBase]: 30854/55262 cut-off events. [2025-03-04 10:06:59,748 INFO L125 PetriNetUnfolderBase]: For 169182/175679 co-relation queries the response was YES. [2025-03-04 10:07:00,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158958 conditions, 55262 events. 30854/55262 cut-off events. For 169182/175679 co-relation queries the response was YES. Maximal size of possible extension queue 2289. Compared 538185 event pairs, 12621 based on Foata normal form. 863/54568 useless extension candidates. Maximal degree in co-relation 157380. Up to 15961 conditions per place. [2025-03-04 10:07:00,201 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 298 selfloop transitions, 80 changer transitions 0/405 dead transitions. [2025-03-04 10:07:00,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 405 transitions, 4121 flow [2025-03-04 10:07:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:07:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:07:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1256 transitions. [2025-03-04 10:07:00,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6874657909140668 [2025-03-04 10:07:00,359 INFO L175 Difference]: Start difference. First operand has 180 places, 154 transitions, 1526 flow. Second operand 21 states and 1256 transitions. [2025-03-04 10:07:00,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 405 transitions, 4121 flow [2025-03-04 10:07:00,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 405 transitions, 4036 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:00,489 INFO L231 Difference]: Finished difference. Result has 199 places, 176 transitions, 1952 flow [2025-03-04 10:07:00,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1952, PETRI_PLACES=199, PETRI_TRANSITIONS=176} [2025-03-04 10:07:00,489 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 115 predicate places. [2025-03-04 10:07:00,489 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 176 transitions, 1952 flow [2025-03-04 10:07:00,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.5625) internal successors, (825), 16 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:00,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:00,490 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:00,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:07:00,693 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-04 10:07:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash 276331809, now seen corresponding path program 2 times [2025-03-04 10:07:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-03-04 10:07:00,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:00,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:07:00,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:00,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:00,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:01,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-03-04 10:07:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247230793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300340037] [2025-03-04 10:07:01,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:01,014 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:01,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:07:01,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:07:01,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:01,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:01,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:07:01,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:01,101 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 6 treesize of output 5 [2025-03-04 10:07:01,147 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 10:07:01,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 10:07:01,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:07:01,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:07:01,235 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 10:07:01,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 10:07:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:01,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:01,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2025-03-04 10:07:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300340037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:01,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-03-04 10:07:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34690175] [2025-03-04 10:07:01,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:01,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:07:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:01,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:07:01,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:07:06,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-03-04 10:07:06,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 176 transitions, 1952 flow. Second operand has 24 states, 24 states have (on average 38.125) internal successors, (915), 24 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:06,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:06,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-03-04 10:07:06,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand