./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:29:12,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:29:12,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:29:12,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:29:12,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:29:12,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:29:12,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:29:12,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:29:12,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:29:12,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:29:12,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:29:12,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:29:12,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:29:12,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:29:12,518 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:29:12,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:29:12,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:29:12,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:29:12,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:29:12,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:29:12,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:29:12,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:29:12,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:29:12,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:29:12,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:29:12,520 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2025-03-17 14:29:12,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:29:12,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:29:12,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:29:12,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:29:12,768 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:29:12,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-17 14:29:13,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f407eb660/a43d9fcde38043dcaf8f738359ccb3a4/FLAGb7989da4a [2025-03-17 14:29:14,199 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:29:14,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-17 14:29:14,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f407eb660/a43d9fcde38043dcaf8f738359ccb3a4/FLAGb7989da4a [2025-03-17 14:29:14,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f407eb660/a43d9fcde38043dcaf8f738359ccb3a4 [2025-03-17 14:29:14,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:29:14,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:29:14,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:29:14,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:29:14,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:29:14,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b74dfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14, skipping insertion in model container [2025-03-17 14:29:14,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:29:14,671 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:29:14,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:29:14,689 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:29:14,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:29:14,732 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:29:14,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14 WrapperNode [2025-03-17 14:29:14,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:29:14,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:29:14,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:29:14,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:29:14,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,781 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 317 [2025-03-17 14:29:14,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:29:14,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:29:14,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:29:14,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:29:14,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,810 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-17 14:29:14,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:29:14,822 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:29:14,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:29:14,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:29:14,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (1/1) ... [2025-03-17 14:29:14,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:29:14,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:14,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:29:14,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:29:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:29:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:29:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:29:14,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:29:14,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:29:14,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:29:14,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:29:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:29:14,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:29:14,870 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:29:14,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:29:14,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:29:15,357 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:29:15,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:29:15,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:29:15,659 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:29:15,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:29:15 BoogieIcfgContainer [2025-03-17 14:29:15,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:29:15,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:29:15,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:29:15,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:29:15,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:29:14" (1/3) ... [2025-03-17 14:29:15,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c30d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:29:15, skipping insertion in model container [2025-03-17 14:29:15,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:29:14" (2/3) ... [2025-03-17 14:29:15,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c30d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:29:15, skipping insertion in model container [2025-03-17 14:29:15,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:29:15" (3/3) ... [2025-03-17 14:29:15,667 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-03-17 14:29:15,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:29:15,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 69 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2025-03-17 14:29:15,682 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:29:15,753 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:29:15,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 178 flow [2025-03-17 14:29:15,811 INFO L124 PetriNetUnfolderBase]: 7/71 cut-off events. [2025-03-17 14:29:15,813 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:29:15,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 7/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 181 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2025-03-17 14:29:15,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 178 flow [2025-03-17 14:29:15,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 70 transitions, 164 flow [2025-03-17 14:29:15,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:29:15,833 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;@3759991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:29:15,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-17 14:29:15,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:29:15,837 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:29:15,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:29:15,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:15,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:15,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:15,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 925023, now seen corresponding path program 1 times [2025-03-17 14:29:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331896241] [2025-03-17 14:29:15,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:15,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:15,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:15,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:15,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331896241] [2025-03-17 14:29:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331896241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:29:16,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752946936] [2025-03-17 14:29:16,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:16,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:16,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:16,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:16,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:16,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:16,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:16,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:18,100 INFO L124 PetriNetUnfolderBase]: 19650/26281 cut-off events. [2025-03-17 14:29:18,101 INFO L125 PetriNetUnfolderBase]: For 500/500 co-relation queries the response was YES. [2025-03-17 14:29:18,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53041 conditions, 26281 events. 19650/26281 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158308 event pairs, 16460 based on Foata normal form. 1/16547 useless extension candidates. Maximal degree in co-relation 50128. Up to 25501 conditions per place. [2025-03-17 14:29:18,298 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 49 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-03-17 14:29:18,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 252 flow [2025-03-17 14:29:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-17 14:29:18,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-17 14:29:18,310 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 164 flow. Second operand 3 states and 108 transitions. [2025-03-17 14:29:18,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 252 flow [2025-03-17 14:29:18,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:29:18,450 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 138 flow [2025-03-17 14:29:18,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-17 14:29:18,456 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -13 predicate places. [2025-03-17 14:29:18,456 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 138 flow [2025-03-17 14:29:18,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:18,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:18,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:18,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:29:18,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:18,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash 925024, now seen corresponding path program 1 times [2025-03-17 14:29:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542942711] [2025-03-17 14:29:18,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:18,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:18,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:18,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:18,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:18,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542942711] [2025-03-17 14:29:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542942711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:18,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128586205] [2025-03-17 14:29:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:18,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:18,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:18,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:18,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:18,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:18,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:18,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:18,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:20,220 INFO L124 PetriNetUnfolderBase]: 19651/26284 cut-off events. [2025-03-17 14:29:20,220 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:29:20,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52261 conditions, 26284 events. 19651/26284 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158366 event pairs, 16460 based on Foata normal form. 0/16546 useless extension candidates. Maximal degree in co-relation 52224. Up to 25514 conditions per place. [2025-03-17 14:29:20,341 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-17 14:29:20,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2025-03-17 14:29:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-17 14:29:20,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-03-17 14:29:20,345 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 4 states and 126 transitions. [2025-03-17 14:29:20,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2025-03-17 14:29:20,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:20,348 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 161 flow [2025-03-17 14:29:20,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2025-03-17 14:29:20,349 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -10 predicate places. [2025-03-17 14:29:20,349 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 161 flow [2025-03-17 14:29:20,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:20,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:20,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:29:20,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:29:20,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:20,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash 28678059, now seen corresponding path program 1 times [2025-03-17 14:29:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:20,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171238164] [2025-03-17 14:29:20,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:20,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:20,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:29:20,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:29:20,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:20,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:20,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171238164] [2025-03-17 14:29:20,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171238164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:20,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:20,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528904202] [2025-03-17 14:29:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:20,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:20,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:20,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:20,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:29:20,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:20,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-17 14:29:20,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:20,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:20,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:22,147 INFO L124 PetriNetUnfolderBase]: 19652/26287 cut-off events. [2025-03-17 14:29:22,147 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:29:22,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52278 conditions, 26287 events. 19652/26287 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158376 event pairs, 16460 based on Foata normal form. 0/16548 useless extension candidates. Maximal degree in co-relation 52253. Up to 25513 conditions per place. [2025-03-17 14:29:22,334 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 53 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-03-17 14:29:22,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 287 flow [2025-03-17 14:29:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-17 14:29:22,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893333333333333 [2025-03-17 14:29:22,337 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 161 flow. Second operand 5 states and 146 transitions. [2025-03-17 14:29:22,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 287 flow [2025-03-17 14:29:22,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:22,340 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 195 flow [2025-03-17 14:29:22,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-17 14:29:22,341 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -5 predicate places. [2025-03-17 14:29:22,341 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 195 flow [2025-03-17 14:29:22,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-17 14:29:22,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:22,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:29:22,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:29:22,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:22,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash 889020320, now seen corresponding path program 1 times [2025-03-17 14:29:22,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:22,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231968979] [2025-03-17 14:29:22,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:22,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:22,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:22,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:22,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:22,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:22,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231968979] [2025-03-17 14:29:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231968979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857173059] [2025-03-17 14:29:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:22,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:22,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:22,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:29:22,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:22,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:22,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:22,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:22,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:23,824 INFO L124 PetriNetUnfolderBase]: 19653/26290 cut-off events. [2025-03-17 14:29:23,825 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-17 14:29:23,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52300 conditions, 26290 events. 19653/26290 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158248 event pairs, 16460 based on Foata normal form. 0/16552 useless extension candidates. Maximal degree in co-relation 52269. Up to 25516 conditions per place. [2025-03-17 14:29:23,909 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 54 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2025-03-17 14:29:23,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 327 flow [2025-03-17 14:29:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-17 14:29:23,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893333333333333 [2025-03-17 14:29:23,911 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 195 flow. Second operand 5 states and 146 transitions. [2025-03-17 14:29:23,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 72 transitions, 327 flow [2025-03-17 14:29:23,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:23,912 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 237 flow [2025-03-17 14:29:23,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2025-03-17 14:29:23,913 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 0 predicate places. [2025-03-17 14:29:23,913 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 237 flow [2025-03-17 14:29:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:23,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:23,913 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:29:23,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:29:23,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:23,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash 888976475, now seen corresponding path program 1 times [2025-03-17 14:29:23,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:23,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942755939] [2025-03-17 14:29:23,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:23,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:23,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:23,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:24,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942755939] [2025-03-17 14:29:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942755939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376986179] [2025-03-17 14:29:24,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:24,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:24,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:24,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:24,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:29:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:24,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:24,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:29:24,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:24,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:29:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:24,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376986179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:24,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:29:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873668663] [2025-03-17 14:29:24,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:24,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:29:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:24,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:29:24,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:29:24,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:24,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 237 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:24,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:24,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:24,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:25,718 INFO L124 PetriNetUnfolderBase]: 19654/26292 cut-off events. [2025-03-17 14:29:25,718 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-17 14:29:25,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52328 conditions, 26292 events. 19654/26292 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158534 event pairs, 16460 based on Foata normal form. 0/16557 useless extension candidates. Maximal degree in co-relation 52284. Up to 25517 conditions per place. [2025-03-17 14:29:25,845 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 55 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2025-03-17 14:29:25,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 378 flow [2025-03-17 14:29:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2025-03-17 14:29:25,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3283333333333333 [2025-03-17 14:29:25,848 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 237 flow. Second operand 8 states and 197 transitions. [2025-03-17 14:29:25,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 378 flow [2025-03-17 14:29:25,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 74 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:25,849 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 261 flow [2025-03-17 14:29:25,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2025-03-17 14:29:25,850 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 4 predicate places. [2025-03-17 14:29:25,850 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 261 flow [2025-03-17 14:29:25,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:25,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:25,850 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:29:25,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:29:26,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:26,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1789840611, now seen corresponding path program 1 times [2025-03-17 14:29:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800830537] [2025-03-17 14:29:26,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:26,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:26,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800830537] [2025-03-17 14:29:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800830537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300735626] [2025-03-17 14:29:26,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:26,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:26,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:29:26,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:26,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:26,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:26,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:26,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:29:26,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:26,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:29:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:26,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300735626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:26,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:29:26,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565979958] [2025-03-17 14:29:26,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:26,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:29:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:26,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:29:26,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:29:26,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:26,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 261 flow. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:26,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:26,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:26,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:27,993 INFO L124 PetriNetUnfolderBase]: 19655/26294 cut-off events. [2025-03-17 14:29:27,993 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:29:28,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52341 conditions, 26294 events. 19655/26294 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158376 event pairs, 16460 based on Foata normal form. 0/16560 useless extension candidates. Maximal degree in co-relation 52290. Up to 25509 conditions per place. [2025-03-17 14:29:28,122 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 49 selfloop transitions, 18 changer transitions 0/76 dead transitions. [2025-03-17 14:29:28,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 405 flow [2025-03-17 14:29:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:29:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:29:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2025-03-17 14:29:28,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3244444444444444 [2025-03-17 14:29:28,123 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 261 flow. Second operand 9 states and 219 transitions. [2025-03-17 14:29:28,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 405 flow [2025-03-17 14:29:28,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 358 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:29:28,125 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 260 flow [2025-03-17 14:29:28,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-17 14:29:28,125 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-17 14:29:28,125 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 260 flow [2025-03-17 14:29:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:28,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:28,126 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-17 14:29:28,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:29:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 14:29:28,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash -349936334, now seen corresponding path program 1 times [2025-03-17 14:29:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607964235] [2025-03-17 14:29:28,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:28,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:29:28,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:29:28,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:28,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607964235] [2025-03-17 14:29:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607964235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183660979] [2025-03-17 14:29:28,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:28,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:28,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:28,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:28,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:29:28,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:29:28,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:29:28,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:28,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:28,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:29:28,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:28,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:29:28,685 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-17 14:29:28,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183660979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:28,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:29:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034816751] [2025-03-17 14:29:28,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:28,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:29:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:28,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:29:28,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:29:28,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:28,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 260 flow. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:28,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:28,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:30,173 INFO L124 PetriNetUnfolderBase]: 19655/26293 cut-off events. [2025-03-17 14:29:30,174 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-17 14:29:30,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52330 conditions, 26293 events. 19655/26293 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 158370 event pairs, 16460 based on Foata normal form. 0/16560 useless extension candidates. Maximal degree in co-relation 52275. Up to 25510 conditions per place. [2025-03-17 14:29:30,293 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 47 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2025-03-17 14:29:30,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 388 flow [2025-03-17 14:29:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:29:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:29:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-17 14:29:30,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33714285714285713 [2025-03-17 14:29:30,294 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 260 flow. Second operand 7 states and 177 transitions. [2025-03-17 14:29:30,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 388 flow [2025-03-17 14:29:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 355 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-17 14:29:30,296 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 261 flow [2025-03-17 14:29:30,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-17 14:29:30,296 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-17 14:29:30,296 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 261 flow [2025-03-17 14:29:30,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:30,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:30,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:30,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:29:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:30,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1204703883, now seen corresponding path program 1 times [2025-03-17 14:29:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766610808] [2025-03-17 14:29:30,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:30,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:29:30,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:29:30,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:30,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:30,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766610808] [2025-03-17 14:29:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766610808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262608789] [2025-03-17 14:29:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:30,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:30,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:30,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-17 14:29:30,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:30,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:30,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-17 14:29:30,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:32,210 INFO L124 PetriNetUnfolderBase]: 22948/30974 cut-off events. [2025-03-17 14:29:32,210 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 14:29:32,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61676 conditions, 30974 events. 22948/30974 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 193226 event pairs, 19427 based on Foata normal form. 719/20983 useless extension candidates. Maximal degree in co-relation 52285. Up to 25522 conditions per place. [2025-03-17 14:29:32,367 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 104 selfloop transitions, 8 changer transitions 0/121 dead transitions. [2025-03-17 14:29:32,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 641 flow [2025-03-17 14:29:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-03-17 14:29:32,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-17 14:29:32,368 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 261 flow. Second operand 5 states and 205 transitions. [2025-03-17 14:29:32,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 641 flow [2025-03-17 14:29:32,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 577 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 14:29:32,370 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 296 flow [2025-03-17 14:29:32,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2025-03-17 14:29:32,371 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-17 14:29:32,371 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 296 flow [2025-03-17 14:29:32,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:32,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:32,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:32,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:29:32,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:32,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -954999760, now seen corresponding path program 1 times [2025-03-17 14:29:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326063184] [2025-03-17 14:29:32,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:32,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:29:32,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:29:32,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:32,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:32,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:32,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326063184] [2025-03-17 14:29:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326063184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:32,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679907444] [2025-03-17 14:29:32,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:32,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:32,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:32,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:32,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:32,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:32,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:32,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:32,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:33,911 INFO L124 PetriNetUnfolderBase]: 17766/24056 cut-off events. [2025-03-17 14:29:33,912 INFO L125 PetriNetUnfolderBase]: For 1470/1470 co-relation queries the response was YES. [2025-03-17 14:29:33,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51909 conditions, 24056 events. 17766/24056 cut-off events. For 1470/1470 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 145837 event pairs, 14876 based on Foata normal form. 0/16675 useless extension candidates. Maximal degree in co-relation 42544. Up to 23314 conditions per place. [2025-03-17 14:29:34,032 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 62 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2025-03-17 14:29:34,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 426 flow [2025-03-17 14:29:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-17 14:29:34,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3626666666666667 [2025-03-17 14:29:34,033 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 296 flow. Second operand 5 states and 136 transitions. [2025-03-17 14:29:34,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 426 flow [2025-03-17 14:29:34,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:34,039 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 297 flow [2025-03-17 14:29:34,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2025-03-17 14:29:34,039 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-17 14:29:34,039 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 297 flow [2025-03-17 14:29:34,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:34,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:34,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:34,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:29:34,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:34,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash -954999757, now seen corresponding path program 1 times [2025-03-17 14:29:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65833999] [2025-03-17 14:29:34,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:34,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:29:34,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:29:34,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65833999] [2025-03-17 14:29:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65833999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:34,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:34,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886484405] [2025-03-17 14:29:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:34,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:34,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:34,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:34,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:34,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-17 14:29:34,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:34,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:34,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-17 14:29:34,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:36,686 INFO L124 PetriNetUnfolderBase]: 42662/56811 cut-off events. [2025-03-17 14:29:36,686 INFO L125 PetriNetUnfolderBase]: For 2076/2076 co-relation queries the response was YES. [2025-03-17 14:29:36,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122882 conditions, 56811 events. 42662/56811 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 2344. Compared 363170 event pairs, 17600 based on Foata normal form. 0/38869 useless extension candidates. Maximal degree in co-relation 101332. Up to 24190 conditions per place. [2025-03-17 14:29:36,950 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 155 selfloop transitions, 12 changer transitions 0/175 dead transitions. [2025-03-17 14:29:36,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 175 transitions, 863 flow [2025-03-17 14:29:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2025-03-17 14:29:36,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-17 14:29:36,952 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 297 flow. Second operand 6 states and 265 transitions. [2025-03-17 14:29:36,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 175 transitions, 863 flow [2025-03-17 14:29:36,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 175 transitions, 852 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:36,959 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 335 flow [2025-03-17 14:29:36,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-03-17 14:29:36,960 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 8 predicate places. [2025-03-17 14:29:36,960 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 335 flow [2025-03-17 14:29:36,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:36,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:36,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:29:36,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:36,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1558992560, now seen corresponding path program 1 times [2025-03-17 14:29:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011734143] [2025-03-17 14:29:36,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:36,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:29:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:29:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011734143] [2025-03-17 14:29:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011734143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233633188] [2025-03-17 14:29:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:37,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:37,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:37,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:37,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-17 14:29:37,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-17 14:29:37,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:37,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-17 14:29:37,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:39,747 INFO L124 PetriNetUnfolderBase]: 44267/61162 cut-off events. [2025-03-17 14:29:39,747 INFO L125 PetriNetUnfolderBase]: For 12190/12190 co-relation queries the response was YES. [2025-03-17 14:29:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137907 conditions, 61162 events. 44267/61162 cut-off events. For 12190/12190 co-relation queries the response was YES. Maximal size of possible extension queue 2480. Compared 423295 event pairs, 38161 based on Foata normal form. 1276/47384 useless extension candidates. Maximal degree in co-relation 95686. Up to 49672 conditions per place. [2025-03-17 14:29:40,087 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 100 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2025-03-17 14:29:40,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 706 flow [2025-03-17 14:29:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2025-03-17 14:29:40,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-17 14:29:40,088 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 335 flow. Second operand 5 states and 195 transitions. [2025-03-17 14:29:40,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 706 flow [2025-03-17 14:29:40,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:40,117 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 426 flow [2025-03-17 14:29:40,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2025-03-17 14:29:40,118 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 13 predicate places. [2025-03-17 14:29:40,118 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 426 flow [2025-03-17 14:29:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-17 14:29:40,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:40,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:40,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:29:40,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:40,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -245411210, now seen corresponding path program 1 times [2025-03-17 14:29:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:40,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242695850] [2025-03-17 14:29:40,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:40,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:29:40,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:40,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:40,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242695850] [2025-03-17 14:29:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242695850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79504321] [2025-03-17 14:29:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:40,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:40,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:40,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:40,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 426 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:40,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:40,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:40,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:42,600 INFO L124 PetriNetUnfolderBase]: 35483/49332 cut-off events. [2025-03-17 14:29:42,600 INFO L125 PetriNetUnfolderBase]: For 13387/13387 co-relation queries the response was YES. [2025-03-17 14:29:42,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119589 conditions, 49332 events. 35483/49332 cut-off events. For 13387/13387 co-relation queries the response was YES. Maximal size of possible extension queue 1972. Compared 336697 event pairs, 30412 based on Foata normal form. 0/38908 useless extension candidates. Maximal degree in co-relation 80133. Up to 47388 conditions per place. [2025-03-17 14:29:42,843 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 67 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2025-03-17 14:29:42,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 82 transitions, 564 flow [2025-03-17 14:29:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-17 14:29:42,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39 [2025-03-17 14:29:42,844 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 426 flow. Second operand 4 states and 117 transitions. [2025-03-17 14:29:42,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 82 transitions, 564 flow [2025-03-17 14:29:42,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 82 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:42,869 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 425 flow [2025-03-17 14:29:42,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=425, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2025-03-17 14:29:42,870 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 13 predicate places. [2025-03-17 14:29:42,870 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 425 flow [2025-03-17 14:29:42,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:42,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:42,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:42,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:29:42,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash -245411209, now seen corresponding path program 1 times [2025-03-17 14:29:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289597015] [2025-03-17 14:29:42,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:42,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:29:42,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:42,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:42,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:42,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289597015] [2025-03-17 14:29:42,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289597015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:42,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:42,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:42,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859010972] [2025-03-17 14:29:42,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:42,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:42,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:42,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:42,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-17 14:29:42,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-17 14:29:42,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:42,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-17 14:29:42,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:47,860 INFO L124 PetriNetUnfolderBase]: 53391/71980 cut-off events. [2025-03-17 14:29:47,861 INFO L125 PetriNetUnfolderBase]: For 18673/18673 co-relation queries the response was YES. [2025-03-17 14:29:48,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176442 conditions, 71980 events. 53391/71980 cut-off events. For 18673/18673 co-relation queries the response was YES. Maximal size of possible extension queue 2588. Compared 475073 event pairs, 24294 based on Foata normal form. 0/54767 useless extension candidates. Maximal degree in co-relation 128920. Up to 35219 conditions per place. [2025-03-17 14:29:48,311 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 138 selfloop transitions, 16 changer transitions 0/162 dead transitions. [2025-03-17 14:29:48,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 162 transitions, 966 flow [2025-03-17 14:29:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-03-17 14:29:48,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-17 14:29:48,312 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 425 flow. Second operand 6 states and 246 transitions. [2025-03-17 14:29:48,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 162 transitions, 966 flow [2025-03-17 14:29:48,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 162 transitions, 959 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:48,336 INFO L231 Difference]: Finished difference. Result has 95 places, 84 transitions, 479 flow [2025-03-17 14:29:48,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2025-03-17 14:29:48,336 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 19 predicate places. [2025-03-17 14:29:48,336 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 479 flow [2025-03-17 14:29:48,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-17 14:29:48,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:48,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:48,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:29:48,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 812189189, now seen corresponding path program 1 times [2025-03-17 14:29:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273978822] [2025-03-17 14:29:48,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:48,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:29:48,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:48,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:48,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:48,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:48,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273978822] [2025-03-17 14:29:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273978822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:48,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722595958] [2025-03-17 14:29:48,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:48,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:48,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:48,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:48,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:29:48,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:29:48,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:48,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:48,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:48,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:29:48,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:48,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:48,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 14:29:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:48,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722595958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:48,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 14:29:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180524434] [2025-03-17 14:29:48,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:29:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:29:48,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:29:48,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-17 14:29:48,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 479 flow. Second operand has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:48,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:48,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-17 14:29:48,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:52,960 INFO L124 PetriNetUnfolderBase]: 42484/58890 cut-off events. [2025-03-17 14:29:52,960 INFO L125 PetriNetUnfolderBase]: For 24649/24649 co-relation queries the response was YES. [2025-03-17 14:29:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149320 conditions, 58890 events. 42484/58890 cut-off events. For 24649/24649 co-relation queries the response was YES. Maximal size of possible extension queue 2055. Compared 401531 event pairs, 21195 based on Foata normal form. 0/48820 useless extension candidates. Maximal degree in co-relation 108081. Up to 25585 conditions per place. [2025-03-17 14:29:53,330 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 114 selfloop transitions, 20 changer transitions 0/143 dead transitions. [2025-03-17 14:29:53,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 143 transitions, 919 flow [2025-03-17 14:29:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2025-03-17 14:29:53,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2025-03-17 14:29:53,331 INFO L175 Difference]: Start difference. First operand has 95 places, 84 transitions, 479 flow. Second operand 6 states and 238 transitions. [2025-03-17 14:29:53,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 143 transitions, 919 flow [2025-03-17 14:29:53,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:53,357 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 508 flow [2025-03-17 14:29:53,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2025-03-17 14:29:53,358 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 23 predicate places. [2025-03-17 14:29:53,358 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 508 flow [2025-03-17 14:29:53,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:53,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:53,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:53,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:29:53,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:53,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-17 14:29:53,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 812189187, now seen corresponding path program 1 times [2025-03-17 14:29:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286757837] [2025-03-17 14:29:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:53,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:29:53,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:53,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:53,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:53,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286757837] [2025-03-17 14:29:53,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286757837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631070422] [2025-03-17 14:29:53,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:53,799 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:29:53,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:29:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:29:53,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:29:53,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:53,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 14:29:53,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:53,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:29:53,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:29:53,913 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-17 14:29:53,931 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:29:53,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 14:29:53,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:29:53,959 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-17 14:29:53,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:29:53,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:29:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:54,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631070422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-03-17 14:29:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962440426] [2025-03-17 14:29:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:54,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:54,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:54,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:29:54,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-17 14:29:54,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:54,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:54,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-17 14:29:54,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand