./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:24:36,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:24:36,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:24:36,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:24:36,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:24:36,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:24:36,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:24:36,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:24:36,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:24:36,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:24:36,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:24:36,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:24:36,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:24:36,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:24:36,387 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:24:36,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:24:36,387 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:24:36,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:24:36,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:24:36,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:24:36,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:24:36,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:24:36,389 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-03-17 14:24:36,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:24:36,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:24:36,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:24:36,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:24:36,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:24:36,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-17 14:24:37,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32603801c/2853a9642b904372ad5dbea5b28cda8a/FLAGe38ef5ef8 [2025-03-17 14:24:38,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:24:38,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-17 14:24:38,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32603801c/2853a9642b904372ad5dbea5b28cda8a/FLAGe38ef5ef8 [2025-03-17 14:24:38,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32603801c/2853a9642b904372ad5dbea5b28cda8a [2025-03-17 14:24:38,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:24:38,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:24:38,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:24:38,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:24:38,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:24:38,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38, skipping insertion in model container [2025-03-17 14:24:38,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:24:38,589 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:24:38,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:24:38,604 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:24:38,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:24:38,647 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:24:38,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38 WrapperNode [2025-03-17 14:24:38,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:24:38,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:24:38,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:24:38,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:24:38,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,680 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 158 [2025-03-17 14:24:38,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:24:38,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:24:38,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:24:38,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:24:38,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,714 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-17 14:24:38,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:24:38,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:24:38,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:24:38,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:24:38,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (1/1) ... [2025-03-17 14:24:38,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:24:38,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:38,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:24:38,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:24:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:24:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:24:38,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:24:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:24:38,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:24:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:24:38,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:24:38,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:24:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:24:38,774 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:24:38,847 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:24:38,848 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:24:39,202 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:24:39,202 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:24:39,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:24:39,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:24:39,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:24:39 BoogieIcfgContainer [2025-03-17 14:24:39,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:24:39,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:24:39,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:24:39,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:24:39,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:24:38" (1/3) ... [2025-03-17 14:24:39,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5898870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:24:39, skipping insertion in model container [2025-03-17 14:24:39,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:38" (2/3) ... [2025-03-17 14:24:39,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5898870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:24:39, skipping insertion in model container [2025-03-17 14:24:39,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:24:39" (3/3) ... [2025-03-17 14:24:39,412 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-03-17 14:24:39,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:24:39,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 85 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-17 14:24:39,427 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:24:39,497 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 14:24:39,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 213 flow [2025-03-17 14:24:39,563 INFO L124 PetriNetUnfolderBase]: 12/93 cut-off events. [2025-03-17 14:24:39,566 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:24:39,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 12/93 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 307 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-17 14:24:39,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 213 flow [2025-03-17 14:24:39,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 202 flow [2025-03-17 14:24:39,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:24:39,594 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;@b8ba431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:24:39,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 14:24:39,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:24:39,597 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:24:39,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:24:39,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:39,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:24:39,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:39,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 662498, now seen corresponding path program 1 times [2025-03-17 14:24:39,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:39,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519516348] [2025-03-17 14:24:39,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:39,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519516348] [2025-03-17 14:24:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519516348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:24:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546643341] [2025-03-17 14:24:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:39,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:24:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:39,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:24:39,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:24:39,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:39,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:39,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:39,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:39,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:40,370 INFO L124 PetriNetUnfolderBase]: 2426/4409 cut-off events. [2025-03-17 14:24:40,370 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-03-17 14:24:40,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 4409 events. 2426/4409 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29903 event pairs, 1460 based on Foata normal form. 1/2907 useless extension candidates. Maximal degree in co-relation 7303. Up to 3188 conditions per place. [2025-03-17 14:24:40,405 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-17 14:24:40,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 280 flow [2025-03-17 14:24:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:24:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:24:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-17 14:24:40,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-17 14:24:40,419 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 202 flow. Second operand 3 states and 189 transitions. [2025-03-17 14:24:40,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 280 flow [2025-03-17 14:24:40,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:24:40,428 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 184 flow [2025-03-17 14:24:40,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-03-17 14:24:40,433 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -9 predicate places. [2025-03-17 14:24:40,434 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 184 flow [2025-03-17 14:24:40,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:40,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:40,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:24:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:24:40,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 662499, now seen corresponding path program 1 times [2025-03-17 14:24:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713906608] [2025-03-17 14:24:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:40,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:40,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:40,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:40,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713906608] [2025-03-17 14:24:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713906608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:40,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:40,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:24:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259168034] [2025-03-17 14:24:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:40,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:40,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:40,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:40,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:40,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:40,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:40,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:41,290 INFO L124 PetriNetUnfolderBase]: 2427/4412 cut-off events. [2025-03-17 14:24:41,291 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-17 14:24:41,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 4412 events. 2427/4412 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29878 event pairs, 1460 based on Foata normal form. 0/2906 useless extension candidates. Maximal degree in co-relation 7632. Up to 3201 conditions per place. [2025-03-17 14:24:41,315 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 46 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-03-17 14:24:41,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 290 flow [2025-03-17 14:24:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:24:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:24:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 14:24:41,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2025-03-17 14:24:41,318 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 184 flow. Second operand 4 states and 239 transitions. [2025-03-17 14:24:41,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 290 flow [2025-03-17 14:24:41,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:41,320 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 207 flow [2025-03-17 14:24:41,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-03-17 14:24:41,323 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-03-17 14:24:41,323 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 207 flow [2025-03-17 14:24:41,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:41,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:41,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:24:41,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:24:41,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:41,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 20539343, now seen corresponding path program 1 times [2025-03-17 14:24:41,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:41,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-03-17 14:24:41,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:41,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:24:41,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:24:41,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:41,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-03-17 14:24:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678167550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746979756] [2025-03-17 14:24:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:41,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:41,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:41,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:41,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:41,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:41,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:41,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:41,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:41,988 INFO L124 PetriNetUnfolderBase]: 2428/4415 cut-off events. [2025-03-17 14:24:41,988 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-17 14:24:41,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7686 conditions, 4415 events. 2428/4415 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29918 event pairs, 1460 based on Foata normal form. 0/2908 useless extension candidates. Maximal degree in co-relation 7661. Up to 3200 conditions per place. [2025-03-17 14:24:42,009 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 46 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-17 14:24:42,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 93 transitions, 319 flow [2025-03-17 14:24:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-17 14:24:42,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-17 14:24:42,011 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 207 flow. Second operand 5 states and 289 transitions. [2025-03-17 14:24:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 93 transitions, 319 flow [2025-03-17 14:24:42,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:42,013 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 241 flow [2025-03-17 14:24:42,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-03-17 14:24:42,014 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-17 14:24:42,014 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 241 flow [2025-03-17 14:24:42,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:42,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:42,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:24:42,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:24:42,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 636723810, now seen corresponding path program 1 times [2025-03-17 14:24:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-03-17 14:24:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:42,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:42,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:42,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:42,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-03-17 14:24:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767116382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:42,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:42,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594488899] [2025-03-17 14:24:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:42,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:42,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:42,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:42,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:42,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:42,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:42,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:42,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:42,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:42,660 INFO L124 PetriNetUnfolderBase]: 2429/4418 cut-off events. [2025-03-17 14:24:42,660 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:24:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7708 conditions, 4418 events. 2429/4418 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29912 event pairs, 1460 based on Foata normal form. 0/2912 useless extension candidates. Maximal degree in co-relation 7677. Up to 3203 conditions per place. [2025-03-17 14:24:42,681 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 47 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-17 14:24:42,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 359 flow [2025-03-17 14:24:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-17 14:24:42,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-03-17 14:24:42,684 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 241 flow. Second operand 5 states and 289 transitions. [2025-03-17 14:24:42,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 359 flow [2025-03-17 14:24:42,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:42,687 INFO L231 Difference]: Finished difference. Result has 94 places, 96 transitions, 283 flow [2025-03-17 14:24:42,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=94, PETRI_TRANSITIONS=96} [2025-03-17 14:24:42,687 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-03-17 14:24:42,688 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 96 transitions, 283 flow [2025-03-17 14:24:42,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:42,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:42,688 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:24:42,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:24:42,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:42,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash 636683051, now seen corresponding path program 1 times [2025-03-17 14:24:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763365240] [2025-03-17 14:24:42,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:42,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:42,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:42,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763365240] [2025-03-17 14:24:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763365240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657802514] [2025-03-17 14:24:42,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:42,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:42,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:42,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:24:42,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:24:42,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:42,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:42,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:42,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:42,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:24:42,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:42,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:24:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:43,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:43,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657802514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:43,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:24:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262459477] [2025-03-17 14:24:43,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:43,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:24:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:43,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:24:43,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:24:43,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:43,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 283 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:43,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:43,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:43,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:44,107 INFO L124 PetriNetUnfolderBase]: 2430/4420 cut-off events. [2025-03-17 14:24:44,107 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 14:24:44,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 4420 events. 2430/4420 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29913 event pairs, 1460 based on Foata normal form. 0/2917 useless extension candidates. Maximal degree in co-relation 7692. Up to 3204 conditions per place. [2025-03-17 14:24:44,130 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 48 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2025-03-17 14:24:44,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 410 flow [2025-03-17 14:24:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:24:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:24:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 430 transitions. [2025-03-17 14:24:44,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2025-03-17 14:24:44,133 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 283 flow. Second operand 8 states and 430 transitions. [2025-03-17 14:24:44,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 410 flow [2025-03-17 14:24:44,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 98 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:44,137 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 307 flow [2025-03-17 14:24:44,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2025-03-17 14:24:44,139 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2025-03-17 14:24:44,140 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 307 flow [2025-03-17 14:24:44,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:44,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:44,141 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:24:44,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:24:44,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:44,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1736507786, now seen corresponding path program 1 times [2025-03-17 14:24:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498490992] [2025-03-17 14:24:44,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:44,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:44,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:44,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:44,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498490992] [2025-03-17 14:24:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498490992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:44,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583530536] [2025-03-17 14:24:44,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:44,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:44,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:44,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:24:44,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:24:44,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:44,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:44,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:24:44,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:44,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:24:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:44,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:44,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583530536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:44,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:44,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:24:44,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732734828] [2025-03-17 14:24:44,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:44,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:44,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:44,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:44,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:45,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:45,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 307 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:45,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:45,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:45,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:45,911 INFO L124 PetriNetUnfolderBase]: 2431/4422 cut-off events. [2025-03-17 14:24:45,911 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 14:24:45,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7749 conditions, 4422 events. 2431/4422 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29891 event pairs, 1460 based on Foata normal form. 0/2920 useless extension candidates. Maximal degree in co-relation 7698. Up to 3196 conditions per place. [2025-03-17 14:24:45,932 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 42 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2025-03-17 14:24:45,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 437 flow [2025-03-17 14:24:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 482 transitions. [2025-03-17 14:24:45,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578703703703703 [2025-03-17 14:24:45,936 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 307 flow. Second operand 9 states and 482 transitions. [2025-03-17 14:24:45,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 437 flow [2025-03-17 14:24:45,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 390 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:24:45,941 INFO L231 Difference]: Finished difference. Result has 97 places, 100 transitions, 306 flow [2025-03-17 14:24:45,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=97, PETRI_TRANSITIONS=100} [2025-03-17 14:24:45,941 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-03-17 14:24:45,941 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 100 transitions, 306 flow [2025-03-17 14:24:45,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:45,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:45,942 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-17 14:24:45,955 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-17 14:24:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 14:24:46,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2006247287, now seen corresponding path program 1 times [2025-03-17 14:24:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118248160] [2025-03-17 14:24:46,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:46,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:24:46,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:24:46,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:46,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118248160] [2025-03-17 14:24:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118248160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134466417] [2025-03-17 14:24:46,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:46,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:46,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:46,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:24:46,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:24:46,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:24:46,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:24:46,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:46,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:46,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:24:46,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:24:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:46,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134466417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:46,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:24:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314573877] [2025-03-17 14:24:46,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:46,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:46,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:46,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:47,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:24:47,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 100 transitions, 306 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:47,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:47,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:24:47,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:47,852 INFO L124 PetriNetUnfolderBase]: 2432/4424 cut-off events. [2025-03-17 14:24:47,852 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:24:47,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7747 conditions, 4424 events. 2432/4424 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29892 event pairs, 1460 based on Foata normal form. 0/2922 useless extension candidates. Maximal degree in co-relation 7683. Up to 3198 conditions per place. [2025-03-17 14:24:47,871 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 40 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2025-03-17 14:24:47,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 102 transitions, 438 flow [2025-03-17 14:24:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 481 transitions. [2025-03-17 14:24:47,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5567129629629629 [2025-03-17 14:24:47,873 INFO L175 Difference]: Start difference. First operand has 97 places, 100 transitions, 306 flow. Second operand 9 states and 481 transitions. [2025-03-17 14:24:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 102 transitions, 438 flow [2025-03-17 14:24:47,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 405 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-17 14:24:47,875 INFO L231 Difference]: Finished difference. Result has 99 places, 102 transitions, 325 flow [2025-03-17 14:24:47,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=325, PETRI_PLACES=99, PETRI_TRANSITIONS=102} [2025-03-17 14:24:47,875 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2025-03-17 14:24:47,875 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 102 transitions, 325 flow [2025-03-17 14:24:47,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:47,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:47,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:47,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:24:48,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:48,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:48,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash -271051237, now seen corresponding path program 1 times [2025-03-17 14:24:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:48,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488748842] [2025-03-17 14:24:48,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:48,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:48,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:24:48,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:24:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:48,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:48,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488748842] [2025-03-17 14:24:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488748842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:48,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:24:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104428914] [2025-03-17 14:24:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:48,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:48,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 102 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:48,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:48,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:48,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:48,581 INFO L124 PetriNetUnfolderBase]: 4331/8288 cut-off events. [2025-03-17 14:24:48,582 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-17 14:24:48,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14256 conditions, 8288 events. 4331/8288 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 65204 event pairs, 2464 based on Foata normal form. 114/5641 useless extension candidates. Maximal degree in co-relation 8793. Up to 3549 conditions per place. [2025-03-17 14:24:48,616 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 128 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2025-03-17 14:24:48,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 172 transitions, 807 flow [2025-03-17 14:24:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 352 transitions. [2025-03-17 14:24:48,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-17 14:24:48,617 INFO L175 Difference]: Start difference. First operand has 99 places, 102 transitions, 325 flow. Second operand 5 states and 352 transitions. [2025-03-17 14:24:48,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 172 transitions, 807 flow [2025-03-17 14:24:48,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 172 transitions, 729 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-17 14:24:48,620 INFO L231 Difference]: Finished difference. Result has 99 places, 104 transitions, 304 flow [2025-03-17 14:24:48,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=99, PETRI_TRANSITIONS=104} [2025-03-17 14:24:48,621 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2025-03-17 14:24:48,622 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 304 flow [2025-03-17 14:24:48,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:48,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:48,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:48,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:24:48,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:48,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1476892829, now seen corresponding path program 1 times [2025-03-17 14:24:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84491901] [2025-03-17 14:24:48,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:48,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:24:48,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:24:48,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:48,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:24:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84491901] [2025-03-17 14:24:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84491901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819565918] [2025-03-17 14:24:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:48,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:48,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:48,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:48,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:48,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:48,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:48,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:49,353 INFO L124 PetriNetUnfolderBase]: 7592/14556 cut-off events. [2025-03-17 14:24:49,353 INFO L125 PetriNetUnfolderBase]: For 1981/1981 co-relation queries the response was YES. [2025-03-17 14:24:49,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26403 conditions, 14556 events. 7592/14556 cut-off events. For 1981/1981 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 125871 event pairs, 4318 based on Foata normal form. 114/10236 useless extension candidates. Maximal degree in co-relation 18890. Up to 5738 conditions per place. [2025-03-17 14:24:49,464 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 117 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2025-03-17 14:24:49,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 167 transitions, 721 flow [2025-03-17 14:24:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-03-17 14:24:49,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6961805555555556 [2025-03-17 14:24:49,466 INFO L175 Difference]: Start difference. First operand has 99 places, 104 transitions, 304 flow. Second operand 6 states and 401 transitions. [2025-03-17 14:24:49,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 167 transitions, 721 flow [2025-03-17 14:24:49,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 167 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:49,469 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 375 flow [2025-03-17 14:24:49,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2025-03-17 14:24:49,470 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2025-03-17 14:24:49,470 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 375 flow [2025-03-17 14:24:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:49,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:49,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:49,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:24:49,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:49,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash 711692953, now seen corresponding path program 1 times [2025-03-17 14:24:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:49,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173328360] [2025-03-17 14:24:49,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:49,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:24:49,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:24:49,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:49,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:24:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173328360] [2025-03-17 14:24:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173328360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992250091] [2025-03-17 14:24:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:49,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:49,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:49,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:49,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:49,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:49,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:49,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:50,201 INFO L124 PetriNetUnfolderBase]: 6633/13317 cut-off events. [2025-03-17 14:24:50,201 INFO L125 PetriNetUnfolderBase]: For 4662/4860 co-relation queries the response was YES. [2025-03-17 14:24:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24955 conditions, 13317 events. 6633/13317 cut-off events. For 4662/4860 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 117133 event pairs, 3968 based on Foata normal form. 174/9440 useless extension candidates. Maximal degree in co-relation 18352. Up to 5988 conditions per place. [2025-03-17 14:24:50,245 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 114 selfloop transitions, 9 changer transitions 0/162 dead transitions. [2025-03-17 14:24:50,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 162 transitions, 773 flow [2025-03-17 14:24:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-17 14:24:50,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840277777777778 [2025-03-17 14:24:50,246 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 375 flow. Second operand 6 states and 394 transitions. [2025-03-17 14:24:50,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 162 transitions, 773 flow [2025-03-17 14:24:50,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 162 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:50,250 INFO L231 Difference]: Finished difference. Result has 111 places, 112 transitions, 405 flow [2025-03-17 14:24:50,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=111, PETRI_TRANSITIONS=112} [2025-03-17 14:24:50,251 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 21 predicate places. [2025-03-17 14:24:50,251 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 112 transitions, 405 flow [2025-03-17 14:24:50,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:50,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:50,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:50,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:24:50,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1625992988, now seen corresponding path program 1 times [2025-03-17 14:24:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:50,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482736402] [2025-03-17 14:24:50,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:50,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:50,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:50,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:50,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:24:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482736402] [2025-03-17 14:24:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482736402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:24:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31145527] [2025-03-17 14:24:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:50,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:50,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:50,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:50,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 96 [2025-03-17 14:24:50,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:50,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:50,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 96 [2025-03-17 14:24:50,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:51,269 INFO L124 PetriNetUnfolderBase]: 8208/15676 cut-off events. [2025-03-17 14:24:51,270 INFO L125 PetriNetUnfolderBase]: For 7198/7448 co-relation queries the response was YES. [2025-03-17 14:24:51,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31498 conditions, 15676 events. 8208/15676 cut-off events. For 7198/7448 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 132856 event pairs, 5488 based on Foata normal form. 0/12110 useless extension candidates. Maximal degree in co-relation 21218. Up to 11080 conditions per place. [2025-03-17 14:24:51,361 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 68 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-17 14:24:51,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 549 flow [2025-03-17 14:24:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2025-03-17 14:24:51,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5145833333333333 [2025-03-17 14:24:51,362 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 405 flow. Second operand 5 states and 247 transitions. [2025-03-17 14:24:51,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 549 flow [2025-03-17 14:24:51,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 537 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:24:51,377 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 401 flow [2025-03-17 14:24:51,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2025-03-17 14:24:51,378 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 18 predicate places. [2025-03-17 14:24:51,378 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 401 flow [2025-03-17 14:24:51,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:51,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:51,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:51,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:24:51,379 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:51,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1625992989, now seen corresponding path program 1 times [2025-03-17 14:24:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330403358] [2025-03-17 14:24:51,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:51,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:51,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:24:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330403358] [2025-03-17 14:24:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330403358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689253620] [2025-03-17 14:24:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:51,588 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-17 14:24:51,589 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-17 14:24:51,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:51,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:51,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:51,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:24:51,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:51,658 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-17 14:24:51,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:51,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:24:51,707 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:24:51,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 14:24:51,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:51,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:24:51,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:51,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:24:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:24:51,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:51,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2025-03-17 14:24:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:24:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689253620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:52,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:24:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393914616] [2025-03-17 14:24:52,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:52,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:24:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:52,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:24:52,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:24:53,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 96 [2025-03-17 14:24:53,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 401 flow. Second operand has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:53,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:53,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 96 [2025-03-17 14:24:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:54,426 INFO L124 PetriNetUnfolderBase]: 10790/19839 cut-off events. [2025-03-17 14:24:54,426 INFO L125 PetriNetUnfolderBase]: For 8098/8562 co-relation queries the response was YES. [2025-03-17 14:24:54,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40041 conditions, 19839 events. 10790/19839 cut-off events. For 8098/8562 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 164115 event pairs, 4637 based on Foata normal form. 0/15487 useless extension candidates. Maximal degree in co-relation 26004. Up to 5057 conditions per place. [2025-03-17 14:24:54,507 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 155 selfloop transitions, 30 changer transitions 0/215 dead transitions. [2025-03-17 14:24:54,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 215 transitions, 1098 flow [2025-03-17 14:24:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 492 transitions. [2025-03-17 14:24:54,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-17 14:24:54,509 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 401 flow. Second operand 9 states and 492 transitions. [2025-03-17 14:24:54,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 215 transitions, 1098 flow [2025-03-17 14:24:54,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 215 transitions, 1082 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:24:54,526 INFO L231 Difference]: Finished difference. Result has 114 places, 120 transitions, 541 flow [2025-03-17 14:24:54,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=541, PETRI_PLACES=114, PETRI_TRANSITIONS=120} [2025-03-17 14:24:54,527 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 24 predicate places. [2025-03-17 14:24:54,527 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 120 transitions, 541 flow [2025-03-17 14:24:54,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:54,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:54,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:54,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:24:54,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:54,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -866599187, now seen corresponding path program 1 times [2025-03-17 14:24:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666110177] [2025-03-17 14:24:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:54,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:54,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:54,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666110177] [2025-03-17 14:24:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666110177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:24:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479180425] [2025-03-17 14:24:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:54,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:54,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:54,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:54,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:54,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 120 transitions, 541 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:54,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:54,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:54,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:55,420 INFO L124 PetriNetUnfolderBase]: 6980/13051 cut-off events. [2025-03-17 14:24:55,420 INFO L125 PetriNetUnfolderBase]: For 11601/12342 co-relation queries the response was YES. [2025-03-17 14:24:55,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28346 conditions, 13051 events. 6980/13051 cut-off events. For 11601/12342 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 103393 event pairs, 4262 based on Foata normal form. 208/10376 useless extension candidates. Maximal degree in co-relation 18629. Up to 6716 conditions per place. [2025-03-17 14:24:55,481 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 139 selfloop transitions, 5 changer transitions 0/179 dead transitions. [2025-03-17 14:24:55,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 179 transitions, 1033 flow [2025-03-17 14:24:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 344 transitions. [2025-03-17 14:24:55,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-03-17 14:24:55,483 INFO L175 Difference]: Start difference. First operand has 114 places, 120 transitions, 541 flow. Second operand 5 states and 344 transitions. [2025-03-17 14:24:55,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 179 transitions, 1033 flow [2025-03-17 14:24:55,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 179 transitions, 1011 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:55,495 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 548 flow [2025-03-17 14:24:55,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2025-03-17 14:24:55,495 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 28 predicate places. [2025-03-17 14:24:55,496 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 548 flow [2025-03-17 14:24:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:55,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:55,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:24:55,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:55,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2142601746, now seen corresponding path program 1 times [2025-03-17 14:24:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-03-17 14:24:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:55,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:24:55,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:24:55,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:55,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:24:55,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:55,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-03-17 14:24:55,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164213666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:55,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:55,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:24:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632085897] [2025-03-17 14:24:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:55,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:55,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:55,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:55,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:55,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:24:55,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:55,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:55,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:24:55,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:56,574 INFO L124 PetriNetUnfolderBase]: 11809/22623 cut-off events. [2025-03-17 14:24:56,574 INFO L125 PetriNetUnfolderBase]: For 18476/19213 co-relation queries the response was YES. [2025-03-17 14:24:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50176 conditions, 22623 events. 11809/22623 cut-off events. For 18476/19213 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 199054 event pairs, 7062 based on Foata normal form. 306/19025 useless extension candidates. Maximal degree in co-relation 35637. Up to 9261 conditions per place. [2025-03-17 14:24:56,685 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 145 selfloop transitions, 17 changer transitions 0/197 dead transitions. [2025-03-17 14:24:56,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 197 transitions, 1210 flow [2025-03-17 14:24:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-17 14:24:56,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-17 14:24:56,687 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 548 flow. Second operand 5 states and 345 transitions. [2025-03-17 14:24:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 197 transitions, 1210 flow [2025-03-17 14:24:56,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 197 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:56,714 INFO L231 Difference]: Finished difference. Result has 122 places, 126 transitions, 619 flow [2025-03-17 14:24:56,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=619, PETRI_PLACES=122, PETRI_TRANSITIONS=126} [2025-03-17 14:24:56,715 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2025-03-17 14:24:56,715 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 126 transitions, 619 flow [2025-03-17 14:24:56,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:56,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:56,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:24:56,715 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1133824280, now seen corresponding path program 1 times [2025-03-17 14:24:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-03-17 14:24:56,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:56,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:24:56,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:24:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:24:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-03-17 14:24:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243111814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:56,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120978652] [2025-03-17 14:24:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:56,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:56,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:56,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 96 [2025-03-17 14:24:56,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 619 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:56,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:56,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 96 [2025-03-17 14:24:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:58,038 INFO L124 PetriNetUnfolderBase]: 13985/24953 cut-off events. [2025-03-17 14:24:58,039 INFO L125 PetriNetUnfolderBase]: For 25683/26631 co-relation queries the response was YES. [2025-03-17 14:24:58,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59501 conditions, 24953 events. 13985/24953 cut-off events. For 25683/26631 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 204733 event pairs, 9481 based on Foata normal form. 42/22404 useless extension candidates. Maximal degree in co-relation 42018. Up to 18967 conditions per place. [2025-03-17 14:24:58,303 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 79 selfloop transitions, 14 changer transitions 0/122 dead transitions. [2025-03-17 14:24:58,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 797 flow [2025-03-17 14:24:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-17 14:24:58,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2025-03-17 14:24:58,304 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 619 flow. Second operand 5 states and 251 transitions. [2025-03-17 14:24:58,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 797 flow [2025-03-17 14:24:58,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 788 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:58,324 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 630 flow [2025-03-17 14:24:58,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2025-03-17 14:24:58,325 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 31 predicate places. [2025-03-17 14:24:58,325 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 630 flow [2025-03-17 14:24:58,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:58,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:58,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:58,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:24:58,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:24:58,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1133824279, now seen corresponding path program 1 times [2025-03-17 14:24:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-03-17 14:24:58,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:58,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:24:58,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:24:58,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:58,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:24:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-03-17 14:24:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155636600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151236047] [2025-03-17 14:24:58,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:58,443 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-17 14:24:58,445 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-17 14:24:58,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:24:58,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:24:58,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:58,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:58,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:24:58,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:58,506 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-17 14:24:58,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:58,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:24:58,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:58,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:24:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:24:58,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:58,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-17 14:24:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:24:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151236047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:58,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:24:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763986222] [2025-03-17 14:24:58,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:58,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:58,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:25:02,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:06,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:10,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:14,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:18,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:22,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:26,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:30,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:35,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:39,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:43,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:47,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:51,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:51,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 96 [2025-03-17 14:25:51,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 630 flow. Second operand has 13 states, 13 states have (on average 35.07692307692308) internal successors, (456), 13 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:51,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:51,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 96 [2025-03-17 14:25:51,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:52,915 INFO L124 PetriNetUnfolderBase]: 17144/28452 cut-off events. [2025-03-17 14:25:52,916 INFO L125 PetriNetUnfolderBase]: For 28226/29542 co-relation queries the response was YES. [2025-03-17 14:25:52,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68706 conditions, 28452 events. 17144/28452 cut-off events. For 28226/29542 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 218008 event pairs, 7813 based on Foata normal form. 216/25369 useless extension candidates. Maximal degree in co-relation 44411. Up to 10103 conditions per place. [2025-03-17 14:25:53,056 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 160 selfloop transitions, 34 changer transitions 0/218 dead transitions. [2025-03-17 14:25:53,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 218 transitions, 1322 flow [2025-03-17 14:25:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 453 transitions. [2025-03-17 14:25:53,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243055555555556 [2025-03-17 14:25:53,058 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 630 flow. Second operand 9 states and 453 transitions. [2025-03-17 14:25:53,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 218 transitions, 1322 flow [2025-03-17 14:25:53,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 218 transitions, 1298 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:25:53,123 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 729 flow [2025-03-17 14:25:53,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=729, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2025-03-17 14:25:53,123 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 37 predicate places. [2025-03-17 14:25:53,123 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 729 flow [2025-03-17 14:25:53,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.07692307692308) internal successors, (456), 13 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:53,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:53,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:53,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:25:53,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:25:53,324 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:53,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash -304141259, now seen corresponding path program 1 times [2025-03-17 14:25:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87861491] [2025-03-17 14:25:53,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:53,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:53,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:53,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:53,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:53,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87861491] [2025-03-17 14:25:53,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87861491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:53,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:53,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:25:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697642109] [2025-03-17 14:25:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:53,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:53,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:53,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:25:53,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:25:53,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 729 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:53,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:53,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:25:53,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:54,241 INFO L124 PetriNetUnfolderBase]: 10919/19107 cut-off events. [2025-03-17 14:25:54,241 INFO L125 PetriNetUnfolderBase]: For 32216/33024 co-relation queries the response was YES. [2025-03-17 14:25:54,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49594 conditions, 19107 events. 10919/19107 cut-off events. For 32216/33024 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 145804 event pairs, 6856 based on Foata normal form. 202/16923 useless extension candidates. Maximal degree in co-relation 36921. Up to 9239 conditions per place. [2025-03-17 14:25:54,351 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 142 selfloop transitions, 17 changer transitions 0/190 dead transitions. [2025-03-17 14:25:54,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 190 transitions, 1419 flow [2025-03-17 14:25:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-03-17 14:25:54,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2025-03-17 14:25:54,352 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 729 flow. Second operand 5 states and 338 transitions. [2025-03-17 14:25:54,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 190 transitions, 1419 flow [2025-03-17 14:25:54,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 190 transitions, 1341 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 14:25:54,380 INFO L231 Difference]: Finished difference. Result has 127 places, 130 transitions, 747 flow [2025-03-17 14:25:54,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=127, PETRI_TRANSITIONS=130} [2025-03-17 14:25:54,381 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 37 predicate places. [2025-03-17 14:25:54,381 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 130 transitions, 747 flow [2025-03-17 14:25:54,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:54,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:54,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:25:54,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1900811992, now seen corresponding path program 1 times [2025-03-17 14:25:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-17 14:25:54,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:54,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:54,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:54,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:54,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-17 14:25:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236565390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407747318] [2025-03-17 14:25:54,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:54,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:54,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:54,496 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-17 14:25:54,498 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-17 14:25:54,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:54,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:54,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:54,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:54,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:25:54,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:54,563 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-17 14:25:54,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:25:54,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:25:54,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:25:54,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:25:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:54,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:54,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-17 14:25:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:54,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407747318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:54,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:54,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:25:54,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698793209] [2025-03-17 14:25:54,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:54,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:25:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:54,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:25:54,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:25:55,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 96 [2025-03-17 14:25:55,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 130 transitions, 747 flow. Second operand has 13 states, 13 states have (on average 45.53846153846154) internal successors, (592), 13 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:55,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:55,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 96 [2025-03-17 14:25:55,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:56,885 INFO L124 PetriNetUnfolderBase]: 15968/26971 cut-off events. [2025-03-17 14:25:56,885 INFO L125 PetriNetUnfolderBase]: For 47558/50417 co-relation queries the response was YES. [2025-03-17 14:25:56,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71226 conditions, 26971 events. 15968/26971 cut-off events. For 47558/50417 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 207904 event pairs, 6623 based on Foata normal form. 216/23754 useless extension candidates. Maximal degree in co-relation 52878. Up to 8613 conditions per place. [2025-03-17 14:25:56,994 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 167 selfloop transitions, 34 changer transitions 0/229 dead transitions. [2025-03-17 14:25:56,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1611 flow [2025-03-17 14:25:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 527 transitions. [2025-03-17 14:25:56,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6099537037037037 [2025-03-17 14:25:56,996 INFO L175 Difference]: Start difference. First operand has 127 places, 130 transitions, 747 flow. Second operand 9 states and 527 transitions. [2025-03-17 14:25:56,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1611 flow [2025-03-17 14:25:57,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 229 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:57,027 INFO L231 Difference]: Finished difference. Result has 134 places, 133 transitions, 832 flow [2025-03-17 14:25:57,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=832, PETRI_PLACES=134, PETRI_TRANSITIONS=133} [2025-03-17 14:25:57,027 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 44 predicate places. [2025-03-17 14:25:57,027 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 133 transitions, 832 flow [2025-03-17 14:25:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.53846153846154) internal successors, (592), 13 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:57,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:57,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:57,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:25:57,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:25:57,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:57,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1204371027, now seen corresponding path program 1 times [2025-03-17 14:25:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26735497] [2025-03-17 14:25:57,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:57,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:57,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:57,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26735497] [2025-03-17 14:25:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26735497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490892710] [2025-03-17 14:25:57,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:57,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:57,366 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-17 14:25:57,368 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-17 14:25:57,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:57,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:25:57,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:57,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:57,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 14:25:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490892710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:57,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:25:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400029858] [2025-03-17 14:25:57,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:57,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:25:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:57,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:25:57,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:25:57,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-03-17 14:25:57,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 832 flow. Second operand has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:57,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:57,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-03-17 14:25:57,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:59,346 INFO L124 PetriNetUnfolderBase]: 14581/24741 cut-off events. [2025-03-17 14:25:59,346 INFO L125 PetriNetUnfolderBase]: For 52131/54218 co-relation queries the response was YES. [2025-03-17 14:25:59,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69173 conditions, 24741 events. 14581/24741 cut-off events. For 52131/54218 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 188065 event pairs, 6597 based on Foata normal form. 163/23158 useless extension candidates. Maximal degree in co-relation 51859. Up to 7800 conditions per place. [2025-03-17 14:25:59,473 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 163 selfloop transitions, 34 changer transitions 0/226 dead transitions. [2025-03-17 14:25:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 226 transitions, 1698 flow [2025-03-17 14:25:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:25:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:25:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 461 transitions. [2025-03-17 14:25:59,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6860119047619048 [2025-03-17 14:25:59,475 INFO L175 Difference]: Start difference. First operand has 134 places, 133 transitions, 832 flow. Second operand 7 states and 461 transitions. [2025-03-17 14:25:59,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 226 transitions, 1698 flow [2025-03-17 14:25:59,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 226 transitions, 1636 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-17 14:25:59,517 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 863 flow [2025-03-17 14:25:59,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=863, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-03-17 14:25:59,518 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 45 predicate places. [2025-03-17 14:25:59,518 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 863 flow [2025-03-17 14:25:59,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:59,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:59,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:59,525 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-17 14:25:59,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:59,719 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:25:59,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1204371026, now seen corresponding path program 1 times [2025-03-17 14:25:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:59,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382358825] [2025-03-17 14:25:59,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:59,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:59,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:59,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:59,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382358825] [2025-03-17 14:25:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382358825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:25:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190805429] [2025-03-17 14:25:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:59,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:59,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:59,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 96 [2025-03-17 14:25:59,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 863 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:59,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:59,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 96 [2025-03-17 14:25:59,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:01,422 INFO L124 PetriNetUnfolderBase]: 15009/25186 cut-off events. [2025-03-17 14:26:01,422 INFO L125 PetriNetUnfolderBase]: For 61643/63784 co-relation queries the response was YES. [2025-03-17 14:26:01,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73993 conditions, 25186 events. 15009/25186 cut-off events. For 61643/63784 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 187408 event pairs, 10109 based on Foata normal form. 563/24452 useless extension candidates. Maximal degree in co-relation 52697. Up to 20259 conditions per place. [2025-03-17 14:26:01,548 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 91 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2025-03-17 14:26:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 129 transitions, 1063 flow [2025-03-17 14:26:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-17 14:26:01,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-03-17 14:26:01,549 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 863 flow. Second operand 4 states and 214 transitions. [2025-03-17 14:26:01,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 129 transitions, 1063 flow [2025-03-17 14:26:01,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 1004 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-17 14:26:01,589 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 822 flow [2025-03-17 14:26:01,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=822, PETRI_PLACES=129, PETRI_TRANSITIONS=129} [2025-03-17 14:26:01,590 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 39 predicate places. [2025-03-17 14:26:01,590 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 822 flow [2025-03-17 14:26:01,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:01,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:01,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:26:01,590 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:26:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2135666589, now seen corresponding path program 1 times [2025-03-17 14:26:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996909526] [2025-03-17 14:26:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:01,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:26:01,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:26:01,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:01,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996909526] [2025-03-17 14:26:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996909526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391765712] [2025-03-17 14:26:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:01,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:01,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:01,654 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-17 14:26:01,655 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-17 14:26:01,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:26:01,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:26:01,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:01,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:01,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:26:01,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:01,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391765712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:01,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-17 14:26:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591790823] [2025-03-17 14:26:01,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:26:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:26:01,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:26:02,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-03-17 14:26:02,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 822 flow. Second operand has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:02,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:02,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-03-17 14:26:02,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:06,044 INFO L124 PetriNetUnfolderBase]: 35009/60137 cut-off events. [2025-03-17 14:26:06,044 INFO L125 PetriNetUnfolderBase]: For 144192/147845 co-relation queries the response was YES. [2025-03-17 14:26:06,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174072 conditions, 60137 events. 35009/60137 cut-off events. For 144192/147845 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 529234 event pairs, 15834 based on Foata normal form. 852/57401 useless extension candidates. Maximal degree in co-relation 131939. Up to 10460 conditions per place. [2025-03-17 14:26:06,387 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 399 selfloop transitions, 80 changer transitions 0/506 dead transitions. [2025-03-17 14:26:06,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 506 transitions, 3928 flow [2025-03-17 14:26:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 14:26:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 14:26:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1750 transitions. [2025-03-17 14:26:06,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285919540229885 [2025-03-17 14:26:06,389 INFO L175 Difference]: Start difference. First operand has 129 places, 129 transitions, 822 flow. Second operand 29 states and 1750 transitions. [2025-03-17 14:26:06,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 506 transitions, 3928 flow [2025-03-17 14:26:06,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 506 transitions, 3899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:06,558 INFO L231 Difference]: Finished difference. Result has 163 places, 186 transitions, 1488 flow [2025-03-17 14:26:06,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1488, PETRI_PLACES=163, PETRI_TRANSITIONS=186} [2025-03-17 14:26:06,558 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 73 predicate places. [2025-03-17 14:26:06,558 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 186 transitions, 1488 flow [2025-03-17 14:26:06,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:06,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:06,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:06,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:06,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 14:26:06,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:26:06,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1646418506, now seen corresponding path program 1 times [2025-03-17 14:26:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-03-17 14:26:06,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:26:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:26:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:07,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-03-17 14:26:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844221790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630239890] [2025-03-17 14:26:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:07,102 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-17 14:26:07,103 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-17 14:26:07,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:26:07,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:26:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:07,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:26:07,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:07,179 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-17 14:26:07,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:26:07,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:26:07,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:26:07,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:26:07,240 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:26:07,240 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 14 treesize of output 13 [2025-03-17 14:26:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:07,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:07,406 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 46 treesize of output 42 [2025-03-17 14:26:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630239890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:07,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:07,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-17 14:26:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694516115] [2025-03-17 14:26:07,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:07,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:26:07,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:07,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:26:07,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:26:11,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]