./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:23:37,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:23:37,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:23:37,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:23:37,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:23:37,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:23:37,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:23:37,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:23:37,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:23:37,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:23:37,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:23:37,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:23:37,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:23:37,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:23:37,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:37,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:23:37,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:23:37,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:23:37,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:23:37,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:23:37,696 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-03-09 01:23:37,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:23:37,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:23:37,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:23:37,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:23:37,921 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:23:37,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-09 01:23:39,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25c1cc6a/0cb68bec0fdd42c1b6e2211561176c9f/FLAG507a6753d [2025-03-09 01:23:39,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:23:39,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-09 01:23:39,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25c1cc6a/0cb68bec0fdd42c1b6e2211561176c9f/FLAG507a6753d [2025-03-09 01:23:39,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25c1cc6a/0cb68bec0fdd42c1b6e2211561176c9f [2025-03-09 01:23:39,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:23:39,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:23:39,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:39,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:23:39,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:23:39,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39, skipping insertion in model container [2025-03-09 01:23:39,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:23:39,462 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-09 01:23:39,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:39,473 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:23:39,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:39,519 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:23:39,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39 WrapperNode [2025-03-09 01:23:39,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:39,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:39,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:23:39,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:23:39,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,556 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 327 [2025-03-09 01:23:39,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:39,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:23:39,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:23:39,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:23:39,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,583 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-09 01:23:39,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:23:39,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:23:39,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:23:39,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:23:39,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (1/1) ... [2025-03-09 01:23:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:39,620 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-09 01:23:39,627 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-09 01:23:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:23:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:23:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:23:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:23:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:23:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:23:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:23:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:23:39,641 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:23:39,734 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:23:39,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:23:40,140 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:23:40,141 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:23:40,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:23:40,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:23:40,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:40 BoogieIcfgContainer [2025-03-09 01:23:40,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:23:40,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:23:40,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:23:40,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:23:40,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:23:39" (1/3) ... [2025-03-09 01:23:40,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a43bcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:40, skipping insertion in model container [2025-03-09 01:23:40,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:39" (2/3) ... [2025-03-09 01:23:40,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a43bcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:40, skipping insertion in model container [2025-03-09 01:23:40,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:40" (3/3) ... [2025-03-09 01:23:40,440 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-03-09 01:23:40,452 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:23:40,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 72 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-03-09 01:23:40,454 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:23:40,514 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:23:40,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 88 transitions, 197 flow [2025-03-09 01:23:40,578 INFO L124 PetriNetUnfolderBase]: 17/85 cut-off events. [2025-03-09 01:23:40,581 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:23:40,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 17/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 232 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2025-03-09 01:23:40,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 88 transitions, 197 flow [2025-03-09 01:23:40,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 84 transitions, 186 flow [2025-03-09 01:23:40,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:23:40,612 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;@117364e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:23:40,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-03-09 01:23:40,615 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:23:40,616 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:23:40,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:23:40,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:40,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:40,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:40,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 916857, now seen corresponding path program 1 times [2025-03-09 01:23:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397678810] [2025-03-09 01:23:40,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:40,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:40,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:40,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:40,836 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-09 01:23:40,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:40,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397678810] [2025-03-09 01:23:40,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397678810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:40,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:40,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:23:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381265730] [2025-03-09 01:23:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:40,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:40,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:40,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:40,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-09 01:23:40,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:40,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:40,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:41,852 INFO L124 PetriNetUnfolderBase]: 7268/10570 cut-off events. [2025-03-09 01:23:41,852 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-03-09 01:23:41,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20386 conditions, 10570 events. 7268/10570 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 70079 event pairs, 5236 based on Foata normal form. 1/5686 useless extension candidates. Maximal degree in co-relation 19698. Up to 9450 conditions per place. [2025-03-09 01:23:41,931 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 54 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-03-09 01:23:41,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 282 flow [2025-03-09 01:23:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-03-09 01:23:41,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-09 01:23:41,944 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 186 flow. Second operand 3 states and 135 transitions. [2025-03-09 01:23:41,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 282 flow [2025-03-09 01:23:41,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 270 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:23:41,953 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 162 flow [2025-03-09 01:23:41,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2025-03-09 01:23:41,959 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2025-03-09 01:23:41,960 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 162 flow [2025-03-09 01:23:41,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-09 01:23:41,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:41,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:41,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:23:41,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:41,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 916858, now seen corresponding path program 1 times [2025-03-09 01:23:41,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-03-09 01:23:41,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:41,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:41,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:42,184 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-09 01:23:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-03-09 01:23:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376097243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:42,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:42,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541127614] [2025-03-09 01:23:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:42,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:42,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:42,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:42,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:42,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-09 01:23:42,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:42,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:42,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:43,002 INFO L124 PetriNetUnfolderBase]: 7271/10579 cut-off events. [2025-03-09 01:23:43,002 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-09 01:23:43,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20186 conditions, 10579 events. 7271/10579 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 70046 event pairs, 5236 based on Foata normal form. 0/5690 useless extension candidates. Maximal degree in co-relation 20136. Up to 9463 conditions per place. [2025-03-09 01:23:43,068 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 58 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2025-03-09 01:23:43,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 318 flow [2025-03-09 01:23:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-03-09 01:23:43,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2025-03-09 01:23:43,070 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 162 flow. Second operand 4 states and 167 transitions. [2025-03-09 01:23:43,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 318 flow [2025-03-09 01:23:43,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:43,072 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 240 flow [2025-03-09 01:23:43,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2025-03-09 01:23:43,073 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2025-03-09 01:23:43,073 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 240 flow [2025-03-09 01:23:43,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-09 01:23:43,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:43,073 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:23:43,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:23:43,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:43,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:43,074 INFO L85 PathProgramCache]: Analyzing trace with hash 881129432, now seen corresponding path program 1 times [2025-03-09 01:23:43,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:43,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-03-09 01:23:43,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:43,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:43,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:43,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:43,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:43,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:43,302 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-09 01:23:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-03-09 01:23:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084028873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919933131] [2025-03-09 01:23:43,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:43,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:43,305 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-09 01:23:43,306 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-09 01:23:43,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:43,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:43,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:43,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:23:43,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:43,417 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-09 01:23:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:43,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:43,624 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-09 01:23:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919933131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:43,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:23:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832595843] [2025-03-09 01:23:43,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:23:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:23:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:23:43,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:43,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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-09 01:23:43,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:43,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:43,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:44,644 INFO L124 PetriNetUnfolderBase]: 7271/10576 cut-off events. [2025-03-09 01:23:44,645 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-09 01:23:44,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20208 conditions, 10576 events. 7271/10576 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 69977 event pairs, 5236 based on Foata normal form. 0/5693 useless extension candidates. Maximal degree in co-relation 20150. Up to 9451 conditions per place. [2025-03-09 01:23:44,701 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 48 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2025-03-09 01:23:44,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 82 transitions, 358 flow [2025-03-09 01:23:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2025-03-09 01:23:44,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-09 01:23:44,703 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 240 flow. Second operand 6 states and 212 transitions. [2025-03-09 01:23:44,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 82 transitions, 358 flow [2025-03-09 01:23:44,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:23:44,706 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 262 flow [2025-03-09 01:23:44,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2025-03-09 01:23:44,706 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-09 01:23:44,706 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 262 flow [2025-03-09 01:23:44,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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-09 01:23:44,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:44,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:44,713 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-09 01:23:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:44,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:44,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -429040348, now seen corresponding path program 1 times [2025-03-09 01:23:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-09 01:23:44,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:23:44,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:23:44,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:44,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:44,990 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-09 01:23:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-09 01:23:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924831775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:23:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497643183] [2025-03-09 01:23:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:44,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:44,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:23:44,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-09 01:23:44,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:44,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:23:44,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:45,853 INFO L124 PetriNetUnfolderBase]: 12118/17662 cut-off events. [2025-03-09 01:23:45,854 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-09 01:23:45,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33762 conditions, 17662 events. 12118/17662 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 122635 event pairs, 4256 based on Foata normal form. 356/10114 useless extension candidates. Maximal degree in co-relation 33688. Up to 9751 conditions per place. [2025-03-09 01:23:45,922 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 99 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-03-09 01:23:45,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 544 flow [2025-03-09 01:23:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-09 01:23:45,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-09 01:23:45,924 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 262 flow. Second operand 3 states and 180 transitions. [2025-03-09 01:23:45,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 544 flow [2025-03-09 01:23:45,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 119 transitions, 494 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-09 01:23:45,928 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 241 flow [2025-03-09 01:23:45,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2025-03-09 01:23:45,928 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -6 predicate places. [2025-03-09 01:23:45,928 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 241 flow [2025-03-09 01:23:45,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-09 01:23:45,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:45,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:23:45,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash -415346918, now seen corresponding path program 1 times [2025-03-09 01:23:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-03-09 01:23:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:45,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:45,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:45,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:45,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:45,973 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-09 01:23:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:45,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-03-09 01:23:45,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7802703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:45,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282789071] [2025-03-09 01:23:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:45,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:45,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:45,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:45,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-03-09 01:23:45,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 01:23:45,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:45,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-03-09 01:23:45,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:46,887 INFO L124 PetriNetUnfolderBase]: 15264/21886 cut-off events. [2025-03-09 01:23:46,888 INFO L125 PetriNetUnfolderBase]: For 1277/1301 co-relation queries the response was YES. [2025-03-09 01:23:46,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45024 conditions, 21886 events. 15264/21886 cut-off events. For 1277/1301 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 138929 event pairs, 5655 based on Foata normal form. 0/14457 useless extension candidates. Maximal degree in co-relation 10198. Up to 10528 conditions per place. [2025-03-09 01:23:46,985 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 100 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-03-09 01:23:46,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 521 flow [2025-03-09 01:23:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-03-09 01:23:46,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:23:46,990 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 241 flow. Second operand 3 states and 160 transitions. [2025-03-09 01:23:46,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 521 flow [2025-03-09 01:23:46,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 116 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:46,992 INFO L231 Difference]: Finished difference. Result has 74 places, 85 transitions, 260 flow [2025-03-09 01:23:46,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=74, PETRI_TRANSITIONS=85} [2025-03-09 01:23:46,994 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-09 01:23:46,994 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 260 flow [2025-03-09 01:23:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 01:23:46,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:46,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:46,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:23:46,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash -626543915, now seen corresponding path program 1 times [2025-03-09 01:23:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696936172] [2025-03-09 01:23:46,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:47,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:23:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:23:47,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:47,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:47,075 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-09 01:23:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696936172] [2025-03-09 01:23:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696936172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:47,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:47,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:47,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121928790] [2025-03-09 01:23:47,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:47,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:47,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:47,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:47,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:47,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:23:47,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-09 01:23:47,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:47,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:23:47,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:48,678 INFO L124 PetriNetUnfolderBase]: 19162/28513 cut-off events. [2025-03-09 01:23:48,679 INFO L125 PetriNetUnfolderBase]: For 4805/4969 co-relation queries the response was YES. [2025-03-09 01:23:48,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60773 conditions, 28513 events. 19162/28513 cut-off events. For 4805/4969 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 195575 event pairs, 7868 based on Foata normal form. 477/19449 useless extension candidates. Maximal degree in co-relation 17559. Up to 12927 conditions per place. [2025-03-09 01:23:48,791 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 105 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-09 01:23:48,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 125 transitions, 582 flow [2025-03-09 01:23:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-09 01:23:48,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-09 01:23:48,792 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 260 flow. Second operand 3 states and 180 transitions. [2025-03-09 01:23:48,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 125 transitions, 582 flow [2025-03-09 01:23:48,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:48,802 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 268 flow [2025-03-09 01:23:48,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2025-03-09 01:23:48,803 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -2 predicate places. [2025-03-09 01:23:48,803 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 268 flow [2025-03-09 01:23:48,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-09 01:23:48,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:48,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:23:48,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2051977122, now seen corresponding path program 1 times [2025-03-09 01:23:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152628492] [2025-03-09 01:23:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:48,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:23:48,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:23:48,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:48,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:48,841 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-09 01:23:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152628492] [2025-03-09 01:23:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152628492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:48,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:48,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703680746] [2025-03-09 01:23:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:48,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:48,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:48,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:48,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:48,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:48,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:48,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:50,281 INFO L124 PetriNetUnfolderBase]: 23770/34271 cut-off events. [2025-03-09 01:23:50,281 INFO L125 PetriNetUnfolderBase]: For 4423/4837 co-relation queries the response was YES. [2025-03-09 01:23:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73063 conditions, 34271 events. 23770/34271 cut-off events. For 4423/4837 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 225479 event pairs, 11883 based on Foata normal form. 0/23391 useless extension candidates. Maximal degree in co-relation 25449. Up to 20204 conditions per place. [2025-03-09 01:23:50,599 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 102 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-09 01:23:50,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 571 flow [2025-03-09 01:23:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-03-09 01:23:50,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 01:23:50,601 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 268 flow. Second operand 3 states and 168 transitions. [2025-03-09 01:23:50,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 571 flow [2025-03-09 01:23:50,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:50,607 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 284 flow [2025-03-09 01:23:50,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2025-03-09 01:23:50,608 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-03-09 01:23:50,609 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 284 flow [2025-03-09 01:23:50,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:50,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:50,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:23:50,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:50,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2018106754, now seen corresponding path program 1 times [2025-03-09 01:23:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-09 01:23:50,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:50,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:23:50,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:23:50,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:50,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:50,693 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-09 01:23:50,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:50,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-09 01:23:50,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758736812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:50,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:50,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312495224] [2025-03-09 01:23:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:50,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:50,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:50,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:50,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:23:50,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-09 01:23:50,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:50,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:23:50,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:52,300 INFO L124 PetriNetUnfolderBase]: 21339/31723 cut-off events. [2025-03-09 01:23:52,300 INFO L125 PetriNetUnfolderBase]: For 8873/9575 co-relation queries the response was YES. [2025-03-09 01:23:52,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70189 conditions, 31723 events. 21339/31723 cut-off events. For 8873/9575 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 214367 event pairs, 16426 based on Foata normal form. 112/21807 useless extension candidates. Maximal degree in co-relation 42125. Up to 26821 conditions per place. [2025-03-09 01:23:52,491 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 97 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-03-09 01:23:52,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 598 flow [2025-03-09 01:23:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-03-09 01:23:52,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-09 01:23:52,493 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 284 flow. Second operand 5 states and 234 transitions. [2025-03-09 01:23:52,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 598 flow [2025-03-09 01:23:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 123 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:52,506 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 332 flow [2025-03-09 01:23:52,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-03-09 01:23:52,510 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-09 01:23:52,511 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 332 flow [2025-03-09 01:23:52,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-09 01:23:52,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:52,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:52,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:23:52,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:52,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1863202088, now seen corresponding path program 1 times [2025-03-09 01:23:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-03-09 01:23:52,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:52,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:23:52,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:23:52,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:52,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:52,557 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-09 01:23:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-03-09 01:23:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733163330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468238690] [2025-03-09 01:23:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:52,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:52,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:52,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:52,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 01:23:52,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:52,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:52,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:55,249 INFO L124 PetriNetUnfolderBase]: 37219/53375 cut-off events. [2025-03-09 01:23:55,249 INFO L125 PetriNetUnfolderBase]: For 12566/13750 co-relation queries the response was YES. [2025-03-09 01:23:55,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119841 conditions, 53375 events. 37219/53375 cut-off events. For 12566/13750 co-relation queries the response was YES. Maximal size of possible extension queue 2220. Compared 357265 event pairs, 21948 based on Foata normal form. 0/36568 useless extension candidates. Maximal degree in co-relation 117461. Up to 24971 conditions per place. [2025-03-09 01:23:55,471 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 106 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-03-09 01:23:55,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 127 transitions, 663 flow [2025-03-09 01:23:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-03-09 01:23:55,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 01:23:55,472 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 332 flow. Second operand 3 states and 168 transitions. [2025-03-09 01:23:55,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 127 transitions, 663 flow [2025-03-09 01:23:55,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 659 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:55,481 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 354 flow [2025-03-09 01:23:55,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2025-03-09 01:23:55,483 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-09 01:23:55,483 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 354 flow [2025-03-09 01:23:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 01:23:55,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:55,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:55,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:23:55,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:55,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 590757724, now seen corresponding path program 1 times [2025-03-09 01:23:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:55,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643021385] [2025-03-09 01:23:55,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:55,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:23:55,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:23:55,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:55,675 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-09 01:23:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643021385] [2025-03-09 01:23:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643021385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920541131] [2025-03-09 01:23:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:55,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:55,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:55,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:55,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:55,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:55,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:55,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:58,034 INFO L124 PetriNetUnfolderBase]: 24142/36406 cut-off events. [2025-03-09 01:23:58,034 INFO L125 PetriNetUnfolderBase]: For 14368/15852 co-relation queries the response was YES. [2025-03-09 01:23:58,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82500 conditions, 36406 events. 24142/36406 cut-off events. For 14368/15852 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 255415 event pairs, 19281 based on Foata normal form. 0/27004 useless extension candidates. Maximal degree in co-relation 80312. Up to 32003 conditions per place. [2025-03-09 01:23:58,200 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 61 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-09 01:23:58,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 474 flow [2025-03-09 01:23:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-09 01:23:58,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-09 01:23:58,201 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 354 flow. Second operand 5 states and 176 transitions. [2025-03-09 01:23:58,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 474 flow [2025-03-09 01:23:58,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 87 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:58,216 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 342 flow [2025-03-09 01:23:58,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2025-03-09 01:23:58,217 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-09 01:23:58,217 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 342 flow [2025-03-09 01:23:58,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:58,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:58,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:58,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:23:58,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:23:58,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash 590757725, now seen corresponding path program 1 times [2025-03-09 01:23:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635233557] [2025-03-09 01:23:58,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:58,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:23:58,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:23:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635233557] [2025-03-09 01:23:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635233557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352759690] [2025-03-09 01:23:58,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:58,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:58,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:58,552 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-09 01:23:58,553 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-09 01:23:58,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:23:58,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:23:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:58,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:23:58,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:58,636 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-09 01:23:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:23:58,688 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 18 treesize of output 13 [2025-03-09 01:23:58,709 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:23:58,709 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-09 01:23:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:23:58,739 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 18 treesize of output 13 [2025-03-09 01:23:58,745 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:23:58,746 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-09 01:23:58,791 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-09 01:23:58,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:23:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:23:58,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-03-09 01:23:58,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406960763] [2025-03-09 01:23:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:58,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:23:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:58,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:23:58,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:23:58,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:23:58,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-09 01:23:58,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:58,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:23:58,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:00,115 INFO L124 PetriNetUnfolderBase]: 18925/28905 cut-off events. [2025-03-09 01:24:00,115 INFO L125 PetriNetUnfolderBase]: For 9084/10332 co-relation queries the response was YES. [2025-03-09 01:24:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63260 conditions, 28905 events. 18925/28905 cut-off events. For 9084/10332 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 197568 event pairs, 14916 based on Foata normal form. 1455/22669 useless extension candidates. Maximal degree in co-relation 61066. Up to 25022 conditions per place. [2025-03-09 01:24:00,298 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 60 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2025-03-09 01:24:00,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 454 flow [2025-03-09 01:24:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-09 01:24:00,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-03-09 01:24:00,299 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 342 flow. Second operand 4 states and 148 transitions. [2025-03-09 01:24:00,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 454 flow [2025-03-09 01:24:00,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 445 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:00,306 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 325 flow [2025-03-09 01:24:00,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2025-03-09 01:24:00,307 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-09 01:24:00,307 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 325 flow [2025-03-09 01:24:00,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-09 01:24:00,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:00,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:00,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:24:00,507 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,SelfDestructingSolverStorable10 [2025-03-09 01:24:00,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:00,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash -961475452, now seen corresponding path program 1 times [2025-03-09 01:24:00,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:00,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-03-09 01:24:00,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:00,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:00,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:24:00,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:24:00,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:00,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-03-09 01:24:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441090443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501267730] [2025-03-09 01:24:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:00,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:00,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:00,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:24:00,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-09 01:24:00,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:00,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:24:00,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:02,300 INFO L124 PetriNetUnfolderBase]: 24421/36146 cut-off events. [2025-03-09 01:24:02,300 INFO L125 PetriNetUnfolderBase]: For 13336/15617 co-relation queries the response was YES. [2025-03-09 01:24:02,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81544 conditions, 36146 events. 24421/36146 cut-off events. For 13336/15617 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 232683 event pairs, 8589 based on Foata normal form. 732/28089 useless extension candidates. Maximal degree in co-relation 79391. Up to 23607 conditions per place. [2025-03-09 01:24:02,549 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 92 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-03-09 01:24:02,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 114 transitions, 606 flow [2025-03-09 01:24:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-09 01:24:02,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-09 01:24:02,550 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 325 flow. Second operand 3 states and 162 transitions. [2025-03-09 01:24:02,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 114 transitions, 606 flow [2025-03-09 01:24:02,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 114 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:02,559 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 339 flow [2025-03-09 01:24:02,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2025-03-09 01:24:02,560 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-09 01:24:02,560 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 339 flow [2025-03-09 01:24:02,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-09 01:24:02,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:02,560 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:24:02,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:02,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -39663669, now seen corresponding path program 1 times [2025-03-09 01:24:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-09 01:24:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:24:02,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:24:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-09 01:24:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672056610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254770834] [2025-03-09 01:24:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:02,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:02,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:02,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:02,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:24:02,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:02,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:02,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:24:02,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:05,766 INFO L124 PetriNetUnfolderBase]: 31285/47144 cut-off events. [2025-03-09 01:24:05,766 INFO L125 PetriNetUnfolderBase]: For 19619/22356 co-relation queries the response was YES. [2025-03-09 01:24:05,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107799 conditions, 47144 events. 31285/47144 cut-off events. For 19619/22356 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 322377 event pairs, 24949 based on Foata normal form. 340/36147 useless extension candidates. Maximal degree in co-relation 103579. Up to 32654 conditions per place. [2025-03-09 01:24:06,114 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 85 selfloop transitions, 12 changer transitions 0/117 dead transitions. [2025-03-09 01:24:06,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 638 flow [2025-03-09 01:24:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-09 01:24:06,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-09 01:24:06,117 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 339 flow. Second operand 5 states and 226 transitions. [2025-03-09 01:24:06,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 638 flow [2025-03-09 01:24:06,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:06,131 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 375 flow [2025-03-09 01:24:06,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2025-03-09 01:24:06,132 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-09 01:24:06,132 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 375 flow [2025-03-09 01:24:06,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:06,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:06,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:06,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:24:06,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:06,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:06,133 INFO L85 PathProgramCache]: Analyzing trace with hash 505380538, now seen corresponding path program 1 times [2025-03-09 01:24:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032372820] [2025-03-09 01:24:06,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:06,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:24:06,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:24:06,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:06,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:06,180 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-09 01:24:06,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:06,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032372820] [2025-03-09 01:24:06,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032372820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:06,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:06,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162578347] [2025-03-09 01:24:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:06,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:06,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:06,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:06,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:24:06,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-09 01:24:06,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:06,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:24:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:08,200 INFO L124 PetriNetUnfolderBase]: 31285/47132 cut-off events. [2025-03-09 01:24:08,201 INFO L125 PetriNetUnfolderBase]: For 20395/23132 co-relation queries the response was YES. [2025-03-09 01:24:08,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108904 conditions, 47132 events. 31285/47132 cut-off events. For 20395/23132 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 317693 event pairs, 11045 based on Foata normal form. 6/35802 useless extension candidates. Maximal degree in co-relation 104679. Up to 36616 conditions per place. [2025-03-09 01:24:08,507 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 71 selfloop transitions, 2 changer transitions 9/102 dead transitions. [2025-03-09 01:24:08,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 102 transitions, 586 flow [2025-03-09 01:24:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-09 01:24:08,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-09 01:24:08,509 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 375 flow. Second operand 3 states and 148 transitions. [2025-03-09 01:24:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 102 transitions, 586 flow [2025-03-09 01:24:08,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 102 transitions, 570 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:08,519 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 327 flow [2025-03-09 01:24:08,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-03-09 01:24:08,520 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-09 01:24:08,520 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 327 flow [2025-03-09 01:24:08,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-09 01:24:08,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:08,520 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:08,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:24:08,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1268346332, now seen corresponding path program 1 times [2025-03-09 01:24:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515622056] [2025-03-09 01:24:08,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:08,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:08,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:08,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515622056] [2025-03-09 01:24:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515622056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072159083] [2025-03-09 01:24:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:08,718 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-09 01:24:08,720 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-09 01:24:08,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:08,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:08,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:08,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:08,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:24:08,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:08,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:08,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072159083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:08,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:24:08,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 01:24:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241689338] [2025-03-09 01:24:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:08,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:08,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:08,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:24:08,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:24:08,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-09 01:24:08,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:08,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:24:08,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:10,809 INFO L124 PetriNetUnfolderBase]: 27130/41448 cut-off events. [2025-03-09 01:24:10,810 INFO L125 PetriNetUnfolderBase]: For 20746/23183 co-relation queries the response was YES. [2025-03-09 01:24:10,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95428 conditions, 41448 events. 27130/41448 cut-off events. For 20746/23183 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 286850 event pairs, 21455 based on Foata normal form. 0/32146 useless extension candidates. Maximal degree in co-relation 95384. Up to 36228 conditions per place. [2025-03-09 01:24:11,107 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 52 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2025-03-09 01:24:11,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 435 flow [2025-03-09 01:24:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-03-09 01:24:11,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-03-09 01:24:11,108 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 327 flow. Second operand 4 states and 156 transitions. [2025-03-09 01:24:11,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 435 flow [2025-03-09 01:24:11,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 423 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:11,120 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 319 flow [2025-03-09 01:24:11,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2025-03-09 01:24:11,121 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-09 01:24:11,121 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 319 flow [2025-03-09 01:24:11,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-09 01:24:11,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:11,121 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:11,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:24:11,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:11,322 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:11,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1023038921, now seen corresponding path program 1 times [2025-03-09 01:24:11,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:11,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973382743] [2025-03-09 01:24:11,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:11,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:11,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:11,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:11,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:11,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:11,356 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-09 01:24:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973382743] [2025-03-09 01:24:11,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973382743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:11,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:11,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-03-09 01:24:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:11,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:11,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:11,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:11,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-03-09 01:24:11,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-09 01:24:11,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:11,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-03-09 01:24:11,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:13,638 INFO L124 PetriNetUnfolderBase]: 29449/42288 cut-off events. [2025-03-09 01:24:13,639 INFO L125 PetriNetUnfolderBase]: For 20714/23073 co-relation queries the response was YES. [2025-03-09 01:24:13,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100516 conditions, 42288 events. 29449/42288 cut-off events. For 20714/23073 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 249803 event pairs, 15757 based on Foata normal form. 474/35675 useless extension candidates. Maximal degree in co-relation 100472. Up to 26799 conditions per place. [2025-03-09 01:24:14,005 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 84 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-09 01:24:14,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 574 flow [2025-03-09 01:24:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-09 01:24:14,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-09 01:24:14,006 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 319 flow. Second operand 3 states and 144 transitions. [2025-03-09 01:24:14,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 574 flow [2025-03-09 01:24:14,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:14,013 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 337 flow [2025-03-09 01:24:14,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-03-09 01:24:14,013 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-09 01:24:14,014 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 337 flow [2025-03-09 01:24:14,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-09 01:24:14,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:14,014 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:14,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:24:14,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:14,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 576269793, now seen corresponding path program 1 times [2025-03-09 01:24:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:14,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-03-09 01:24:14,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:14,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:14,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:14,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:14,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:14,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:14,074 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-09 01:24:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-03-09 01:24:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717929570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326107431] [2025-03-09 01:24:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:14,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:14,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:14,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-03-09 01:24:14,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-09 01:24:14,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:14,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-03-09 01:24:14,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:16,124 INFO L124 PetriNetUnfolderBase]: 20049/30508 cut-off events. [2025-03-09 01:24:16,124 INFO L125 PetriNetUnfolderBase]: For 22726/24841 co-relation queries the response was YES. [2025-03-09 01:24:16,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72189 conditions, 30508 events. 20049/30508 cut-off events. For 22726/24841 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 195446 event pairs, 16312 based on Foata normal form. 1518/25845 useless extension candidates. Maximal degree in co-relation 72146. Up to 27054 conditions per place. [2025-03-09 01:24:16,250 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-09 01:24:16,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 441 flow [2025-03-09 01:24:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-09 01:24:16,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2025-03-09 01:24:16,251 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 337 flow. Second operand 4 states and 142 transitions. [2025-03-09 01:24:16,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 441 flow [2025-03-09 01:24:16,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:16,259 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 325 flow [2025-03-09 01:24:16,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-09 01:24:16,259 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-09 01:24:16,259 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 325 flow [2025-03-09 01:24:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-09 01:24:16,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:16,259 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:24:16,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash 323458962, now seen corresponding path program 1 times [2025-03-09 01:24:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:16,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-03-09 01:24:16,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:16,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:24:16,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:24:16,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:16,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:24:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-03-09 01:24:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484234762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546471207] [2025-03-09 01:24:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:16,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:16,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:16,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:16,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-03-09 01:24:16,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:16,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:16,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-03-09 01:24:16,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:19,187 INFO L124 PetriNetUnfolderBase]: 30537/44719 cut-off events. [2025-03-09 01:24:19,187 INFO L125 PetriNetUnfolderBase]: For 24594/27628 co-relation queries the response was YES. [2025-03-09 01:24:19,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106492 conditions, 44719 events. 30537/44719 cut-off events. For 24594/27628 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 269364 event pairs, 19837 based on Foata normal form. 680/37628 useless extension candidates. Maximal degree in co-relation 106448. Up to 33291 conditions per place. [2025-03-09 01:24:19,380 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 83 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-03-09 01:24:19,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 572 flow [2025-03-09 01:24:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-03-09 01:24:19,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-03-09 01:24:19,381 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 325 flow. Second operand 3 states and 142 transitions. [2025-03-09 01:24:19,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 572 flow [2025-03-09 01:24:19,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:19,390 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 347 flow [2025-03-09 01:24:19,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-03-09 01:24:19,390 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-09 01:24:19,390 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 347 flow [2025-03-09 01:24:19,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:19,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:19,391 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:19,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:24:19,391 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-09 01:24:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 765347022, now seen corresponding path program 1 times [2025-03-09 01:24:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086513194] [2025-03-09 01:24:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:19,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:24:19,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:24:19,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:19,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:19,645 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-09 01:24:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086513194] [2025-03-09 01:24:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086513194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748638080] [2025-03-09 01:24:19,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:19,647 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-09 01:24:19,649 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-09 01:24:19,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:24:19,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:24:19,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:19,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:19,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:24:19,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:24:19,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:19,860 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:24:19,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2025-03-09 01:24:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:24:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748638080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:19,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:24:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009933551] [2025-03-09 01:24:19,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:19,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:24:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:19,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:24:19,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:24:19,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-03-09 01:24:19,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 347 flow. Second operand has 15 states, 15 states have (on average 32.06666666666667) internal successors, (481), 15 states have internal predecessors, (481), 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-09 01:24:19,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:19,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-03-09 01:24:19,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand