./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.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-nzb-file-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:07:20,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:07:20,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:07:20,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:07:20,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:07:20,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:07:20,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:07:20,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:07:20,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:07:20,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:07:20,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:07:20,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:07:20,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:07:20,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:07:20,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:07:20,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:07:20,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:20,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:07:20,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:07:20,326 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-03-04 10:07:20,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:07:20,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:07:20,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:07:20,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:07:20,536 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:07:20,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-04 10:07:21,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5819f7490/f7bec41676584783b83f9ebeccf7f0d0/FLAGf600111f0 [2025-03-04 10:07:21,854 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:07:21,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-04 10:07:21,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5819f7490/f7bec41676584783b83f9ebeccf7f0d0/FLAGf600111f0 [2025-03-04 10:07:22,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5819f7490/f7bec41676584783b83f9ebeccf7f0d0 [2025-03-04 10:07:22,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:07:22,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:07:22,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:22,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:07:22,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:07:22,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48336898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22, skipping insertion in model container [2025-03-04 10:07:22,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:07:22,401 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:07:22,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:22,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:07:22,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:22,466 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:07:22,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22 WrapperNode [2025-03-04 10:07:22,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:22,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:22,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:07:22,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:07:22,473 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:07:22" (1/1) ... [2025-03-04 10:07:22,483 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:07:22" (1/1) ... [2025-03-04 10:07:22,519 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 401 [2025-03-04 10:07:22,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:22,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:07:22,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:07:22,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:07:22,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,552 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 10:07:22,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:07:22,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:07:22,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:07:22,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:07:22,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (1/1) ... [2025-03-04 10:07:22,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:22,606 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:07:22,608 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:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:07:22,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:07:22,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:07:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:07:22,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:07:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:07:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:07:22,625 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:07:22,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:07:22,708 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:07:23,261 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:07:23,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:07:23,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:07:23,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:07:23,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:23 BoogieIcfgContainer [2025-03-04 10:07:23,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:07:23,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:07:23,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:07:23,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:07:23,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:07:22" (1/3) ... [2025-03-04 10:07:23,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df036bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:23, skipping insertion in model container [2025-03-04 10:07:23,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:22" (2/3) ... [2025-03-04 10:07:23,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df036bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:23, skipping insertion in model container [2025-03-04 10:07:23,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:23" (3/3) ... [2025-03-04 10:07:23,575 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-03-04 10:07:23,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:07:23,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 107 locations, 1 initial locations, 4 loop locations, and 38 error locations. [2025-03-04 10:07:23,591 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:07:23,668 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:07:23,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 126 transitions, 266 flow [2025-03-04 10:07:23,736 INFO L124 PetriNetUnfolderBase]: 20/124 cut-off events. [2025-03-04 10:07:23,739 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:07:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 124 events. 20/124 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 393 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2025-03-04 10:07:23,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 126 transitions, 266 flow [2025-03-04 10:07:23,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 123 transitions, 258 flow [2025-03-04 10:07:23,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:07:23,766 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;@76edbbca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:07:23,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-04 10:07:23,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:07:23,769 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:07:23,769 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:07:23,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:23,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:23,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1169888, now seen corresponding path program 1 times [2025-03-04 10:07:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729273026] [2025-03-04 10:07:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:23,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:23,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:23,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:23,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:23,953 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:07:23,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:23,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729273026] [2025-03-04 10:07:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729273026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:23,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:07:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901707705] [2025-03-04 10:07:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:23,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:23,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:23,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:24,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-04 10:07:24,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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:24,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:24,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-04 10:07:24,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:24,516 INFO L124 PetriNetUnfolderBase]: 1446/3461 cut-off events. [2025-03-04 10:07:24,516 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 10:07:24,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3461 events. 1446/3461 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25166 event pairs, 790 based on Foata normal form. 1/2625 useless extension candidates. Maximal degree in co-relation 5456. Up to 2083 conditions per place. [2025-03-04 10:07:24,536 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 56 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-04 10:07:24,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 117 transitions, 362 flow [2025-03-04 10:07:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-04 10:07:24,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-03-04 10:07:24,554 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 258 flow. Second operand 3 states and 249 transitions. [2025-03-04 10:07:24,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 117 transitions, 362 flow [2025-03-04 10:07:24,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:24,563 INFO L231 Difference]: Finished difference. Result has 104 places, 117 transitions, 242 flow [2025-03-04 10:07:24,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=104, PETRI_TRANSITIONS=117} [2025-03-04 10:07:24,569 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-03-04 10:07:24,570 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 117 transitions, 242 flow [2025-03-04 10:07:24,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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:24,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:24,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:07:24,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:24,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1169889, now seen corresponding path program 1 times [2025-03-04 10:07:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660589379] [2025-03-04 10:07:24,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:24,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:24,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:24,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:24,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:24,862 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:07:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660589379] [2025-03-04 10:07:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660589379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117042672] [2025-03-04 10:07:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:24,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:24,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:24,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-04 10:07:24,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 117 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:24,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:24,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-04 10:07:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,328 INFO L124 PetriNetUnfolderBase]: 1448/3467 cut-off events. [2025-03-04 10:07:25,328 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 10:07:25,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 3467 events. 1448/3467 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25234 event pairs, 790 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 5549. Up to 2092 conditions per place. [2025-03-04 10:07:25,340 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 61 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-04 10:07:25,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 388 flow [2025-03-04 10:07:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-04 10:07:25,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671957671957672 [2025-03-04 10:07:25,342 INFO L175 Difference]: Start difference. First operand has 104 places, 117 transitions, 242 flow. Second operand 3 states and 254 transitions. [2025-03-04 10:07:25,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 388 flow [2025-03-04 10:07:25,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:25,345 INFO L231 Difference]: Finished difference. Result has 106 places, 121 transitions, 278 flow [2025-03-04 10:07:25,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=106, PETRI_TRANSITIONS=121} [2025-03-04 10:07:25,345 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -4 predicate places. [2025-03-04 10:07:25,345 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 121 transitions, 278 flow [2025-03-04 10:07:25,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:25,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:25,346 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:07:25,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:07:25,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1124298277, now seen corresponding path program 1 times [2025-03-04 10:07:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506156248] [2025-03-04 10:07:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:25,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:25,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:25,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:25,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,607 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:07:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506156248] [2025-03-04 10:07:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506156248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613106171] [2025-03-04 10:07:25,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:25,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:25,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:25,611 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:07:25,612 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:07:25,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:25,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:25,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:25,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:07:25,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:25,731 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:25,783 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:07:25,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:25,835 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:07:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613106171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:25,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-04 10:07:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274306632] [2025-03-04 10:07:25,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:07:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:25,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:07:25,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:07:26,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-04 10:07:26,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 278 flow. Second operand has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 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:26,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:26,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-04 10:07:26,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:26,441 INFO L124 PetriNetUnfolderBase]: 1450/3481 cut-off events. [2025-03-04 10:07:26,441 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:07:26,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 3481 events. 1450/3481 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25245 event pairs, 790 based on Foata normal form. 4/2648 useless extension candidates. Maximal degree in co-relation 5581. Up to 2093 conditions per place. [2025-03-04 10:07:26,455 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 66 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2025-03-04 10:07:26,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 488 flow [2025-03-04 10:07:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-03-04 10:07:26,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-04 10:07:26,458 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 278 flow. Second operand 6 states and 462 transitions. [2025-03-04 10:07:26,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 488 flow [2025-03-04 10:07:26,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 137 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:26,460 INFO L231 Difference]: Finished difference. Result has 112 places, 129 transitions, 362 flow [2025-03-04 10:07:26,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=112, PETRI_TRANSITIONS=129} [2025-03-04 10:07:26,460 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-03-04 10:07:26,461 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 129 transitions, 362 flow [2025-03-04 10:07:26,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 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:26,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,461 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 10:07:26,467 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:07:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:26,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:26,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash -851368719, now seen corresponding path program 2 times [2025-03-04 10:07:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346956624] [2025-03-04 10:07:26,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:07:26,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:07:26,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:26,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346956624] [2025-03-04 10:07:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346956624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030016529] [2025-03-04 10:07:26,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:26,925 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:07:26,927 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:07:26,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:07:27,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:07:27,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:27,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:07:27,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:27,023 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:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:27,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030016529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:27,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-04 10:07:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175968542] [2025-03-04 10:07:27,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:27,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:07:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:27,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:07:27,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:07:27,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-04 10:07:27,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 129 transitions, 362 flow. Second operand has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 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:27,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:27,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-04 10:07:27,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:28,593 INFO L124 PetriNetUnfolderBase]: 1452/3485 cut-off events. [2025-03-04 10:07:28,593 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-04 10:07:28,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 3485 events. 1452/3485 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25280 event pairs, 790 based on Foata normal form. 4/2654 useless extension candidates. Maximal degree in co-relation 5593. Up to 2086 conditions per place. [2025-03-04 10:07:28,608 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 61 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2025-03-04 10:07:28,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 141 transitions, 554 flow [2025-03-04 10:07:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 646 transitions. [2025-03-04 10:07:28,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696649029982364 [2025-03-04 10:07:28,610 INFO L175 Difference]: Start difference. First operand has 112 places, 129 transitions, 362 flow. Second operand 9 states and 646 transitions. [2025-03-04 10:07:28,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 141 transitions, 554 flow [2025-03-04 10:07:28,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 141 transitions, 496 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:28,616 INFO L231 Difference]: Finished difference. Result has 114 places, 133 transitions, 370 flow [2025-03-04 10:07:28,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=370, PETRI_PLACES=114, PETRI_TRANSITIONS=133} [2025-03-04 10:07:28,617 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-04 10:07:28,617 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 370 flow [2025-03-04 10:07:28,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 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:28,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:28,618 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:28,626 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:07:28,823 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,SelfDestructingSolverStorable3 [2025-03-04 10:07:28,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 551373356, now seen corresponding path program 1 times [2025-03-04 10:07:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393155951] [2025-03-04 10:07:28,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:28,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:07:28,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:07:28,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:28,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393155951] [2025-03-04 10:07:28,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393155951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:28,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199737007] [2025-03-04 10:07:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:28,919 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:07:28,921 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:07:28,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:07:29,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:07:29,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:29,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:07:29,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:29,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199737007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:29,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:07:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316513057] [2025-03-04 10:07:29,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:29,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:07:29,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:29,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:07:29,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:07:29,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-04 10:07:29,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 370 flow. Second operand has 10 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 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:29,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-04 10:07:29,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:29,383 INFO L124 PetriNetUnfolderBase]: 1446/3479 cut-off events. [2025-03-04 10:07:29,383 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:07:29,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5654 conditions, 3479 events. 1446/3479 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25177 event pairs, 790 based on Foata normal form. 6/2650 useless extension candidates. Maximal degree in co-relation 5549. Up to 2087 conditions per place. [2025-03-04 10:07:29,399 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 62 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2025-03-04 10:07:29,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 135 transitions, 522 flow [2025-03-04 10:07:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:07:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:07:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 530 transitions. [2025-03-04 10:07:29,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6009070294784581 [2025-03-04 10:07:29,401 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 370 flow. Second operand 7 states and 530 transitions. [2025-03-04 10:07:29,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 135 transitions, 522 flow [2025-03-04 10:07:29,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 490 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:29,403 INFO L231 Difference]: Finished difference. Result has 114 places, 127 transitions, 334 flow [2025-03-04 10:07:29,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=114, PETRI_TRANSITIONS=127} [2025-03-04 10:07:29,403 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-04 10:07:29,403 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 127 transitions, 334 flow [2025-03-04 10:07:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 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:29,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:29,404 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:29,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:07:29,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:29,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:29,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1439896439, now seen corresponding path program 2 times [2025-03-04 10:07:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:29,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773089382] [2025-03-04 10:07:29,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:29,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:29,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:07:29,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 29 statements. [2025-03-04 10:07:29,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773089382] [2025-03-04 10:07:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773089382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:29,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:29,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786357670] [2025-03-04 10:07:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:29,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:29,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:29,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:29,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-03-04 10:07:29,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 127 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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:29,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-03-04 10:07:29,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:29,988 INFO L124 PetriNetUnfolderBase]: 1446/3291 cut-off events. [2025-03-04 10:07:29,988 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:07:29,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 3291 events. 1446/3291 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22580 event pairs, 790 based on Foata normal form. 0/2643 useless extension candidates. Maximal degree in co-relation 5364. Up to 2082 conditions per place. [2025-03-04 10:07:30,001 INFO L140 encePairwiseOnDemand]: 115/126 looper letters, 67 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-03-04 10:07:30,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 458 flow [2025-03-04 10:07:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-03-04 10:07:30,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:07:30,003 INFO L175 Difference]: Start difference. First operand has 114 places, 127 transitions, 334 flow. Second operand 5 states and 336 transitions. [2025-03-04 10:07:30,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 458 flow [2025-03-04 10:07:30,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 119 transitions, 426 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:30,005 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 292 flow [2025-03-04 10:07:30,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2025-03-04 10:07:30,006 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-03-04 10:07:30,006 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 292 flow [2025-03-04 10:07:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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:30,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:30,006 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:07:30,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:30,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1439896440, now seen corresponding path program 1 times [2025-03-04 10:07:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111852761] [2025-03-04 10:07:30,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:07:30,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:07:30,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:30,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:07:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111852761] [2025-03-04 10:07:30,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111852761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199430779] [2025-03-04 10:07:30,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:30,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:30,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:30,473 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:07:30,475 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:07:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:07:30,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:07:30,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:30,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:30,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 10:07:30,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:30,584 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:30,708 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:07:30,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:07:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:31,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199430779] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:31,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 12] total 26 [2025-03-04 10:07:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83320051] [2025-03-04 10:07:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:07:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:31,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:07:31,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:07:31,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:31,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 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:31,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:31,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:31,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:32,178 INFO L124 PetriNetUnfolderBase]: 2117/4066 cut-off events. [2025-03-04 10:07:32,179 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 10:07:32,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 4066 events. 2117/4066 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 25131 event pairs, 598 based on Foata normal form. 0/3381 useless extension candidates. Maximal degree in co-relation 7197. Up to 2114 conditions per place. [2025-03-04 10:07:32,190 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 99 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-04 10:07:32,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 150 transitions, 567 flow [2025-03-04 10:07:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2025-03-04 10:07:32,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6044973544973545 [2025-03-04 10:07:32,193 INFO L175 Difference]: Start difference. First operand has 104 places, 119 transitions, 292 flow. Second operand 6 states and 457 transitions. [2025-03-04 10:07:32,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 150 transitions, 567 flow [2025-03-04 10:07:32,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 150 transitions, 562 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:32,197 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 306 flow [2025-03-04 10:07:32,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2025-03-04 10:07:32,198 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -5 predicate places. [2025-03-04 10:07:32,199 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 306 flow [2025-03-04 10:07:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 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:32,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:32,200 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:32,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:32,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:32,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 614949009, now seen corresponding path program 1 times [2025-03-04 10:07:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:32,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495070637] [2025-03-04 10:07:32,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:32,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:07:32,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:07:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:07:32,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495070637] [2025-03-04 10:07:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495070637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232243562] [2025-03-04 10:07:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:32,690 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:07:32,692 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:07:32,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:07:32,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:07:32,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:32,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:07:32,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:32,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:32,971 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 20 treesize of output 16 [2025-03-04 10:07:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232243562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:33,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-04 10:07:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106727631] [2025-03-04 10:07:33,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:07:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:33,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:07:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:07:33,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:33,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 306 flow. Second operand has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 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:33,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:33,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:33,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:34,947 INFO L124 PetriNetUnfolderBase]: 4185/8570 cut-off events. [2025-03-04 10:07:34,948 INFO L125 PetriNetUnfolderBase]: For 964/1022 co-relation queries the response was YES. [2025-03-04 10:07:34,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15518 conditions, 8570 events. 4185/8570 cut-off events. For 964/1022 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 59650 event pairs, 768 based on Foata normal form. 0/7428 useless extension candidates. Maximal degree in co-relation 15424. Up to 2462 conditions per place. [2025-03-04 10:07:34,974 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 144 selfloop transitions, 15 changer transitions 0/201 dead transitions. [2025-03-04 10:07:34,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 201 transitions, 840 flow [2025-03-04 10:07:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 760 transitions. [2025-03-04 10:07:34,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-03-04 10:07:34,977 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 306 flow. Second operand 10 states and 760 transitions. [2025-03-04 10:07:34,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 201 transitions, 840 flow [2025-03-04 10:07:34,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 826 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:34,982 INFO L231 Difference]: Finished difference. Result has 110 places, 116 transitions, 341 flow [2025-03-04 10:07:34,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=341, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2025-03-04 10:07:34,984 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-03-04 10:07:34,984 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 341 flow [2025-03-04 10:07:34,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 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:34,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:34,985 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:34,991 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:07:35,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:35,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:35,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash 614949008, now seen corresponding path program 1 times [2025-03-04 10:07:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:35,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721436272] [2025-03-04 10:07:35,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:35,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:07:35,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:07:35,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:07:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721436272] [2025-03-04 10:07:35,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721436272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:35,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:35,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996428935] [2025-03-04 10:07:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:35,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:35,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:35,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:35,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-03-04 10:07:35,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:35,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:35,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-03-04 10:07:35,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:35,806 INFO L124 PetriNetUnfolderBase]: 4097/7958 cut-off events. [2025-03-04 10:07:35,806 INFO L125 PetriNetUnfolderBase]: For 1265/1319 co-relation queries the response was YES. [2025-03-04 10:07:35,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15296 conditions, 7958 events. 4097/7958 cut-off events. For 1265/1319 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51731 event pairs, 2625 based on Foata normal form. 158/7118 useless extension candidates. Maximal degree in co-relation 15190. Up to 6062 conditions per place. [2025-03-04 10:07:35,832 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 71 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-04 10:07:35,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 471 flow [2025-03-04 10:07:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-03-04 10:07:35,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-03-04 10:07:35,835 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 341 flow. Second operand 4 states and 282 transitions. [2025-03-04 10:07:35,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 108 transitions, 471 flow [2025-03-04 10:07:35,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 450 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:35,839 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 308 flow [2025-03-04 10:07:35,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-03-04 10:07:35,840 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -11 predicate places. [2025-03-04 10:07:35,840 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 308 flow [2025-03-04 10:07:35,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:35,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:35,840 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:07:35,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 761047900, now seen corresponding path program 1 times [2025-03-04 10:07:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792304956] [2025-03-04 10:07:35,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:35,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:07:35,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:07:35,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:35,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:07:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792304956] [2025-03-04 10:07:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792304956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534747438] [2025-03-04 10:07:36,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:36,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:36,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:36,085 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:07:36,087 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:07:36,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:07:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:07:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:36,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:07:36,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:36,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:36,352 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 20 treesize of output 16 [2025-03-04 10:07:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534747438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:36,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-04 10:07:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100514510] [2025-03-04 10:07:36,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:07:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:36,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:07:36,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:07:37,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:37,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 308 flow. Second operand has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 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:37,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:37,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:38,501 INFO L124 PetriNetUnfolderBase]: 9460/17539 cut-off events. [2025-03-04 10:07:38,501 INFO L125 PetriNetUnfolderBase]: For 2449/2527 co-relation queries the response was YES. [2025-03-04 10:07:38,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33992 conditions, 17539 events. 9460/17539 cut-off events. For 2449/2527 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 120719 event pairs, 2682 based on Foata normal form. 0/14921 useless extension candidates. Maximal degree in co-relation 33894. Up to 5035 conditions per place. [2025-03-04 10:07:38,564 INFO L140 encePairwiseOnDemand]: 111/126 looper letters, 164 selfloop transitions, 18 changer transitions 0/213 dead transitions. [2025-03-04 10:07:38,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 213 transitions, 949 flow [2025-03-04 10:07:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 780 transitions. [2025-03-04 10:07:38,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:07:38,566 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 308 flow. Second operand 10 states and 780 transitions. [2025-03-04 10:07:38,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 213 transitions, 949 flow [2025-03-04 10:07:38,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 213 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:38,572 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 400 flow [2025-03-04 10:07:38,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2025-03-04 10:07:38,573 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -1 predicate places. [2025-03-04 10:07:38,573 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 114 transitions, 400 flow [2025-03-04 10:07:38,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 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:38,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:38,574 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:38,584 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:07:38,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:38,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:38,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1739449195, now seen corresponding path program 1 times [2025-03-04 10:07:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292180230] [2025-03-04 10:07:38,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:38,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:38,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:07:38,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:07:38,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:38,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:07:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292180230] [2025-03-04 10:07:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292180230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65500846] [2025-03-04 10:07:39,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:39,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:39,083 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:07:39,085 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:07:39,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:07:39,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:07:39,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:39,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:39,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 10:07:39,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:39,200 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:39,303 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:07:39,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:07:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:39,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65500846] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 13] total 26 [2025-03-04 10:07:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220588994] [2025-03-04 10:07:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:39,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:07:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:39,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:07:39,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:07:40,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:40,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 114 transitions, 400 flow. Second operand has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 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:40,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:40,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:40,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:41,636 INFO L124 PetriNetUnfolderBase]: 11605/21037 cut-off events. [2025-03-04 10:07:41,636 INFO L125 PetriNetUnfolderBase]: For 7674/8118 co-relation queries the response was YES. [2025-03-04 10:07:41,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43501 conditions, 21037 events. 11605/21037 cut-off events. For 7674/8118 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 147966 event pairs, 4204 based on Foata normal form. 0/17967 useless extension candidates. Maximal degree in co-relation 43390. Up to 8492 conditions per place. [2025-03-04 10:07:41,707 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 125 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-03-04 10:07:41,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 166 transitions, 837 flow [2025-03-04 10:07:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2025-03-04 10:07:41,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-03-04 10:07:41,709 INFO L175 Difference]: Start difference. First operand has 109 places, 114 transitions, 400 flow. Second operand 6 states and 471 transitions. [2025-03-04 10:07:41,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 166 transitions, 837 flow [2025-03-04 10:07:41,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 166 transitions, 816 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:41,716 INFO L231 Difference]: Finished difference. Result has 110 places, 119 transitions, 446 flow [2025-03-04 10:07:41,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=110, PETRI_TRANSITIONS=119} [2025-03-04 10:07:41,717 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-03-04 10:07:41,717 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 119 transitions, 446 flow [2025-03-04 10:07:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 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:41,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:41,717 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:41,723 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:07:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:41,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1580452108, now seen corresponding path program 1 times [2025-03-04 10:07:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310019312] [2025-03-04 10:07:41,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:07:41,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:07:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:42,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310019312] [2025-03-04 10:07:42,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310019312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:42,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:42,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:07:42,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15205758] [2025-03-04 10:07:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:42,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:42,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:42,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:42,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-04 10:07:42,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 119 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:42,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:42,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-04 10:07:42,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:43,883 INFO L124 PetriNetUnfolderBase]: 11054/21060 cut-off events. [2025-03-04 10:07:43,883 INFO L125 PetriNetUnfolderBase]: For 12358/12726 co-relation queries the response was YES. [2025-03-04 10:07:43,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46220 conditions, 21060 events. 11054/21060 cut-off events. For 12358/12726 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 154230 event pairs, 6653 based on Foata normal form. 6/18392 useless extension candidates. Maximal degree in co-relation 46114. Up to 15403 conditions per place. [2025-03-04 10:07:43,982 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 114 selfloop transitions, 1 changer transitions 9/159 dead transitions. [2025-03-04 10:07:43,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 159 transitions, 831 flow [2025-03-04 10:07:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2025-03-04 10:07:43,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6924603174603174 [2025-03-04 10:07:43,984 INFO L175 Difference]: Start difference. First operand has 110 places, 119 transitions, 446 flow. Second operand 4 states and 349 transitions. [2025-03-04 10:07:43,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 159 transitions, 831 flow [2025-03-04 10:07:43,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 159 transitions, 826 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:43,997 INFO L231 Difference]: Finished difference. Result has 112 places, 119 transitions, 450 flow [2025-03-04 10:07:43,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=112, PETRI_TRANSITIONS=119} [2025-03-04 10:07:43,998 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-03-04 10:07:43,998 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 119 transitions, 450 flow [2025-03-04 10:07:43,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:43,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:43,998 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:43,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:07:43,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1921187488, now seen corresponding path program 2 times [2025-03-04 10:07:43,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:43,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317699496] [2025-03-04 10:07:43,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:43,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:44,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:07:44,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-03-04 10:07:44,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:44,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317699496] [2025-03-04 10:07:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317699496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:07:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923161443] [2025-03-04 10:07:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:44,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:44,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:44,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:44,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-04 10:07:44,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 119 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:44,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:44,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-04 10:07:44,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:46,416 INFO L124 PetriNetUnfolderBase]: 11313/21657 cut-off events. [2025-03-04 10:07:46,416 INFO L125 PetriNetUnfolderBase]: For 13314/13682 co-relation queries the response was YES. [2025-03-04 10:07:46,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47695 conditions, 21657 events. 11313/21657 cut-off events. For 13314/13682 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 159612 event pairs, 6969 based on Foata normal form. 5/18913 useless extension candidates. Maximal degree in co-relation 47619. Up to 15958 conditions per place. [2025-03-04 10:07:46,507 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 114 selfloop transitions, 1 changer transitions 7/157 dead transitions. [2025-03-04 10:07:46,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 157 transitions, 827 flow [2025-03-04 10:07:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-03-04 10:07:46,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2025-03-04 10:07:46,509 INFO L175 Difference]: Start difference. First operand has 112 places, 119 transitions, 450 flow. Second operand 4 states and 347 transitions. [2025-03-04 10:07:46,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 157 transitions, 827 flow [2025-03-04 10:07:46,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 157 transitions, 821 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:46,523 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 456 flow [2025-03-04 10:07:46,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-03-04 10:07:46,524 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-04 10:07:46,524 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 456 flow [2025-03-04 10:07:46,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:46,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:46,525 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:46,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:07:46,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:46,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -259270709, now seen corresponding path program 1 times [2025-03-04 10:07:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837917603] [2025-03-04 10:07:46,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:46,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:07:46,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:07:46,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:46,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837917603] [2025-03-04 10:07:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837917603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301037447] [2025-03-04 10:07:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:46,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:46,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:46,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-04 10:07:46,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:46,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:46,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-04 10:07:46,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:47,933 INFO L124 PetriNetUnfolderBase]: 10579/20281 cut-off events. [2025-03-04 10:07:47,933 INFO L125 PetriNetUnfolderBase]: For 13650/14014 co-relation queries the response was YES. [2025-03-04 10:07:47,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44748 conditions, 20281 events. 10579/20281 cut-off events. For 13650/14014 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 148322 event pairs, 4067 based on Foata normal form. 161/17812 useless extension candidates. Maximal degree in co-relation 44695. Up to 15331 conditions per place. [2025-03-04 10:07:48,025 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 87 selfloop transitions, 2 changer transitions 5/129 dead transitions. [2025-03-04 10:07:48,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 129 transitions, 685 flow [2025-03-04 10:07:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-04 10:07:48,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-03-04 10:07:48,027 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 456 flow. Second operand 3 states and 262 transitions. [2025-03-04 10:07:48,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 129 transitions, 685 flow [2025-03-04 10:07:48,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 682 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:48,042 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 474 flow [2025-03-04 10:07:48,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-03-04 10:07:48,042 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-04 10:07:48,042 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 474 flow [2025-03-04 10:07:48,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:48,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:48,043 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:48,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:07:48,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1380170616, now seen corresponding path program 1 times [2025-03-04 10:07:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645484429] [2025-03-04 10:07:48,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:48,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:07:48,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:07:48,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:48,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645484429] [2025-03-04 10:07:48,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645484429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:48,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:48,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720168555] [2025-03-04 10:07:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:48,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:48,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:48,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:48,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-04 10:07:48,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:48,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:48,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-04 10:07:48,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:49,455 INFO L124 PetriNetUnfolderBase]: 10248/19431 cut-off events. [2025-03-04 10:07:49,455 INFO L125 PetriNetUnfolderBase]: For 13603/13951 co-relation queries the response was YES. [2025-03-04 10:07:49,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43486 conditions, 19431 events. 10248/19431 cut-off events. For 13603/13951 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 141000 event pairs, 5947 based on Foata normal form. 86/17038 useless extension candidates. Maximal degree in co-relation 43380. Up to 12655 conditions per place. [2025-03-04 10:07:49,559 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 120 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2025-03-04 10:07:49,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 158 transitions, 867 flow [2025-03-04 10:07:49,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-03-04 10:07:49,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2025-03-04 10:07:49,561 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 474 flow. Second operand 3 states and 282 transitions. [2025-03-04 10:07:49,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 158 transitions, 867 flow [2025-03-04 10:07:49,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 158 transitions, 857 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:49,580 INFO L231 Difference]: Finished difference. Result has 113 places, 120 transitions, 481 flow [2025-03-04 10:07:49,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=113, PETRI_TRANSITIONS=120} [2025-03-04 10:07:49,581 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 3 predicate places. [2025-03-04 10:07:49,581 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 120 transitions, 481 flow [2025-03-04 10:07:49,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:49,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:49,582 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:49,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:07:49,582 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:49,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1524945477, now seen corresponding path program 1 times [2025-03-04 10:07:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492299010] [2025-03-04 10:07:49,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:49,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:49,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:07:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:07:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:07:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492299010] [2025-03-04 10:07:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492299010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077726541] [2025-03-04 10:07:49,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:49,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:49,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:49,881 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:07:49,882 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:07:49,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:07:49,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:07:49,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:49,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:49,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:07:49,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:50,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077726541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:50,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:50,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-04 10:07:50,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802610991] [2025-03-04 10:07:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:50,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:50,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:50,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:50,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-03-04 10:07:50,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 120 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:50,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:50,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-03-04 10:07:50,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:52,853 INFO L124 PetriNetUnfolderBase]: 17013/30638 cut-off events. [2025-03-04 10:07:52,854 INFO L125 PetriNetUnfolderBase]: For 21180/21970 co-relation queries the response was YES. [2025-03-04 10:07:52,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70288 conditions, 30638 events. 17013/30638 cut-off events. For 21180/21970 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 229472 event pairs, 7099 based on Foata normal form. 0/27399 useless extension candidates. Maximal degree in co-relation 70182. Up to 15603 conditions per place. [2025-03-04 10:07:53,053 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 253 selfloop transitions, 7 changer transitions 0/292 dead transitions. [2025-03-04 10:07:53,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 292 transitions, 1689 flow [2025-03-04 10:07:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:07:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:07:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 622 transitions. [2025-03-04 10:07:53,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7052154195011338 [2025-03-04 10:07:53,055 INFO L175 Difference]: Start difference. First operand has 113 places, 120 transitions, 481 flow. Second operand 7 states and 622 transitions. [2025-03-04 10:07:53,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 292 transitions, 1689 flow [2025-03-04 10:07:53,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 292 transitions, 1686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:53,083 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 515 flow [2025-03-04 10:07:53,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-03-04 10:07:53,084 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2025-03-04 10:07:53,084 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 515 flow [2025-03-04 10:07:53,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:53,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:53,084 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:53,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:07:53,284 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,SelfDestructingSolverStorable15 [2025-03-04 10:07:53,284 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2128143458, now seen corresponding path program 1 times [2025-03-04 10:07:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751875569] [2025-03-04 10:07:53,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:07:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:07:53,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:53,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751875569] [2025-03-04 10:07:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751875569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:53,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:07:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581318955] [2025-03-04 10:07:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:53,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:53,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:53,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:53,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:53,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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:53,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:53,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:55,949 INFO L124 PetriNetUnfolderBase]: 18116/31825 cut-off events. [2025-03-04 10:07:55,949 INFO L125 PetriNetUnfolderBase]: For 24969/25810 co-relation queries the response was YES. [2025-03-04 10:07:56,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79154 conditions, 31825 events. 18116/31825 cut-off events. For 24969/25810 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 231391 event pairs, 7383 based on Foata normal form. 0/29311 useless extension candidates. Maximal degree in co-relation 79044. Up to 14771 conditions per place. [2025-03-04 10:07:56,144 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 209 selfloop transitions, 12 changer transitions 0/252 dead transitions. [2025-03-04 10:07:56,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 252 transitions, 1469 flow [2025-03-04 10:07:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-03-04 10:07:56,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-03-04 10:07:56,146 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 515 flow. Second operand 6 states and 524 transitions. [2025-03-04 10:07:56,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 252 transitions, 1469 flow [2025-03-04 10:07:56,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 252 transitions, 1462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:56,213 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 555 flow [2025-03-04 10:07:56,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2025-03-04 10:07:56,214 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 17 predicate places. [2025-03-04 10:07:56,214 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 555 flow [2025-03-04 10:07:56,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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:56,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:56,214 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:56,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:07:56,214 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:56,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1950744669, now seen corresponding path program 1 times [2025-03-04 10:07:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132546746] [2025-03-04 10:07:56,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:56,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:07:56,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:07:56,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:56,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132546746] [2025-03-04 10:07:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132546746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:07:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373448311] [2025-03-04 10:07:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:56,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:56,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:07:56,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:56,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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:56,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:56,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:56,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:59,050 INFO L124 PetriNetUnfolderBase]: 20866/35627 cut-off events. [2025-03-04 10:07:59,050 INFO L125 PetriNetUnfolderBase]: For 30393/31513 co-relation queries the response was YES. [2025-03-04 10:07:59,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92309 conditions, 35627 events. 20866/35627 cut-off events. For 30393/31513 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 258508 event pairs, 7930 based on Foata normal form. 288/34132 useless extension candidates. Maximal degree in co-relation 92198. Up to 16686 conditions per place. [2025-03-04 10:07:59,267 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 218 selfloop transitions, 10 changer transitions 0/259 dead transitions. [2025-03-04 10:07:59,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 259 transitions, 1541 flow [2025-03-04 10:07:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-03-04 10:07:59,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-03-04 10:07:59,269 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 555 flow. Second operand 6 states and 528 transitions. [2025-03-04 10:07:59,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 259 transitions, 1541 flow [2025-03-04 10:07:59,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 259 transitions, 1525 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:59,318 INFO L231 Difference]: Finished difference. Result has 131 places, 127 transitions, 590 flow [2025-03-04 10:07:59,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=131, PETRI_TRANSITIONS=127} [2025-03-04 10:07:59,318 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 21 predicate places. [2025-03-04 10:07:59,319 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 127 transitions, 590 flow [2025-03-04 10:07:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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:59,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:59,319 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:59,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:07:59,319 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:07:59,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1948611136, now seen corresponding path program 1 times [2025-03-04 10:07:59,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687411602] [2025-03-04 10:07:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:59,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:07:59,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:07:59,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:59,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:59,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687411602] [2025-03-04 10:07:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687411602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:07:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628582942] [2025-03-04 10:07:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:59,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:59,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:59,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:59,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:07:59,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 127 transitions, 590 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 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:59,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:59,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:07:59,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:02,126 INFO L124 PetriNetUnfolderBase]: 20571/35423 cut-off events. [2025-03-04 10:08:02,126 INFO L125 PetriNetUnfolderBase]: For 35918/36995 co-relation queries the response was YES. [2025-03-04 10:08:02,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94864 conditions, 35423 events. 20571/35423 cut-off events. For 35918/36995 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 257551 event pairs, 10082 based on Foata normal form. 305/33816 useless extension candidates. Maximal degree in co-relation 94751. Up to 19134 conditions per place. [2025-03-04 10:08:02,364 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 177 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2025-03-04 10:08:02,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 222 transitions, 1351 flow [2025-03-04 10:08:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2025-03-04 10:08:02,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-03-04 10:08:02,366 INFO L175 Difference]: Start difference. First operand has 131 places, 127 transitions, 590 flow. Second operand 5 states and 438 transitions. [2025-03-04 10:08:02,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 222 transitions, 1351 flow [2025-03-04 10:08:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 222 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:02,475 INFO L231 Difference]: Finished difference. Result has 134 places, 127 transitions, 613 flow [2025-03-04 10:08:02,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=613, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2025-03-04 10:08:02,475 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 24 predicate places. [2025-03-04 10:08:02,475 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 613 flow [2025-03-04 10:08:02,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 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:08:02,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:02,475 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:02,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:08:02,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:08:02,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -221721959, now seen corresponding path program 1 times [2025-03-04 10:08:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498656324] [2025-03-04 10:08:02,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:02,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:08:02,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:08:02,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:02,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:08:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498656324] [2025-03-04 10:08:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498656324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634602149] [2025-03-04 10:08:02,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:02,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:02,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:02,708 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:08:02,709 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:08:02,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:08:02,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:08:02,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:02,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:02,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:08:02,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:08:02,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:08:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634602149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:02,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:08:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 10:08:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032640339] [2025-03-04 10:08:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:08:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:02,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:08:02,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:08:02,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-03-04 10:08:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:08:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-03-04 10:08:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:07,171 INFO L124 PetriNetUnfolderBase]: 26465/49248 cut-off events. [2025-03-04 10:08:07,172 INFO L125 PetriNetUnfolderBase]: For 74182/75826 co-relation queries the response was YES. [2025-03-04 10:08:07,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131469 conditions, 49248 events. 26465/49248 cut-off events. For 74182/75826 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 409178 event pairs, 13237 based on Foata normal form. 482/46345 useless extension candidates. Maximal degree in co-relation 131355. Up to 26269 conditions per place. [2025-03-04 10:08:07,446 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 295 selfloop transitions, 6 changer transitions 0/333 dead transitions. [2025-03-04 10:08:07,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 333 transitions, 2491 flow [2025-03-04 10:08:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:08:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:08:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 616 transitions. [2025-03-04 10:08:07,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-03-04 10:08:07,448 INFO L175 Difference]: Start difference. First operand has 134 places, 127 transitions, 613 flow. Second operand 7 states and 616 transitions. [2025-03-04 10:08:07,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 333 transitions, 2491 flow [2025-03-04 10:08:07,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 333 transitions, 2393 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:07,536 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 630 flow [2025-03-04 10:08:07,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2025-03-04 10:08:07,537 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 31 predicate places. [2025-03-04 10:08:07,537 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 630 flow [2025-03-04 10:08:07,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:08:07,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:07,537 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:07,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:08:07,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:07,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:08:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash 249218047, now seen corresponding path program 1 times [2025-03-04 10:08:07,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:07,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746350894] [2025-03-04 10:08:07,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:07,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:07,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:08:07,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:08:07,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:07,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:08:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746350894] [2025-03-04 10:08:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746350894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919154406] [2025-03-04 10:08:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:08,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:08,017 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:08:08,018 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:08:08,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:08:08,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:08:08,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:08,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:08,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 10:08:08,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:08,127 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:08:08,218 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:08:08,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:08:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:08,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:08:08,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919154406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:08,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:08,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 9] total 30 [2025-03-04 10:08:08,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461760936] [2025-03-04 10:08:08,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:08,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:08:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:08,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:08:08,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:08:10,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 126 [2025-03-04 10:08:10,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 630 flow. Second operand has 32 states, 32 states have (on average 59.375) internal successors, (1900), 32 states have internal predecessors, (1900), 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:08:10,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:10,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 126 [2025-03-04 10:08:10,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:19,841 INFO L124 PetriNetUnfolderBase]: 46839/87124 cut-off events. [2025-03-04 10:08:19,841 INFO L125 PetriNetUnfolderBase]: For 128936/133050 co-relation queries the response was YES. [2025-03-04 10:08:20,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249981 conditions, 87124 events. 46839/87124 cut-off events. For 128936/133050 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 766635 event pairs, 6713 based on Foata normal form. 1520/85704 useless extension candidates. Maximal degree in co-relation 249852. Up to 20484 conditions per place. [2025-03-04 10:08:20,487 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 300 selfloop transitions, 28 changer transitions 0/362 dead transitions. [2025-03-04 10:08:20,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 362 transitions, 2373 flow [2025-03-04 10:08:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:08:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:08:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1369 transitions. [2025-03-04 10:08:20,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432539682539682 [2025-03-04 10:08:20,489 INFO L175 Difference]: Start difference. First operand has 141 places, 130 transitions, 630 flow. Second operand 20 states and 1369 transitions. [2025-03-04 10:08:20,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 362 transitions, 2373 flow [2025-03-04 10:08:20,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 362 transitions, 2352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:20,660 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 791 flow [2025-03-04 10:08:20,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=791, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2025-03-04 10:08:20,661 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 53 predicate places. [2025-03-04 10:08:20,661 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 791 flow [2025-03-04 10:08:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 59.375) internal successors, (1900), 32 states have internal predecessors, (1900), 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:08:20,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:20,662 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:20,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:08:20,862 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,SelfDestructingSolverStorable20 [2025-03-04 10:08:20,862 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:08:20,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1567084899, now seen corresponding path program 1 times [2025-03-04 10:08:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980866862] [2025-03-04 10:08:20,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:08:20,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:08:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:08:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980866862] [2025-03-04 10:08:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980866862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:20,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:20,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779289270] [2025-03-04 10:08:20,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:20,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:20,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:20,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:20,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-04 10:08:20,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 791 flow. Second operand has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 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:08:20,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:20,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-04 10:08:20,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:31,193 INFO L124 PetriNetUnfolderBase]: 53041/95430 cut-off events. [2025-03-04 10:08:31,193 INFO L125 PetriNetUnfolderBase]: For 185265/189586 co-relation queries the response was YES. [2025-03-04 10:08:31,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274481 conditions, 95430 events. 53041/95430 cut-off events. For 185265/189586 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 824403 event pairs, 22002 based on Foata normal form. 1102/92304 useless extension candidates. Maximal degree in co-relation 274381. Up to 43397 conditions per place. [2025-03-04 10:08:32,111 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 281 selfloop transitions, 11 changer transitions 0/323 dead transitions. [2025-03-04 10:08:32,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 323 transitions, 2748 flow [2025-03-04 10:08:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-03-04 10:08:32,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-03-04 10:08:32,112 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 791 flow. Second operand 6 states and 524 transitions. [2025-03-04 10:08:32,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 323 transitions, 2748 flow [2025-03-04 10:08:32,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 323 transitions, 2710 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:08:32,521 INFO L231 Difference]: Finished difference. Result has 163 places, 141 transitions, 810 flow [2025-03-04 10:08:32,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=810, PETRI_PLACES=163, PETRI_TRANSITIONS=141} [2025-03-04 10:08:32,522 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 53 predicate places. [2025-03-04 10:08:32,522 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 141 transitions, 810 flow [2025-03-04 10:08:32,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 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:08:32,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:32,522 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:32,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:08:32,522 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:08:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2089428773, now seen corresponding path program 1 times [2025-03-04 10:08:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955266500] [2025-03-04 10:08:32,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:32,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:08:32,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:08:32,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:32,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:08:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955266500] [2025-03-04 10:08:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955266500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175206716] [2025-03-04 10:08:32,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:32,778 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:08:32,779 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:08:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:08:32,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:08:32,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:32,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:32,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:32,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:08:32,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:08:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175206716] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:08:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 16 [2025-03-04 10:08:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348977135] [2025-03-04 10:08:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:33,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:33,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:33,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:08:33,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-04 10:08:33,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 141 transitions, 810 flow. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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:08:33,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:33,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-04 10:08:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand