./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:42:45,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:42:45,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:42:45,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:42:45,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:42:45,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:42:45,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:42:45,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:42:45,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:42:45,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:42:45,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:42:45,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:42:45,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:42:45,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:42:45,857 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:42:45,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:42:45,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:42:45,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:42:45,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:42:45,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:42:45,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:42:45,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:42:45,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:42:45,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:42:45,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:42:45,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:42:45,860 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 ! call(reach_error())) ) 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-03-13 21:42:46,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:42:46,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:42:46,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:42:46,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:42:46,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:42:46,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-13 21:42:47,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e90ec71/01e7485175d243b3b9232b0ee09fb6d2/FLAGa54d51052 [2025-03-13 21:42:47,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:42:47,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-13 21:42:47,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e90ec71/01e7485175d243b3b9232b0ee09fb6d2/FLAGa54d51052 [2025-03-13 21:42:47,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e90ec71/01e7485175d243b3b9232b0ee09fb6d2 [2025-03-13 21:42:47,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:42:47,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:42:47,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:42:47,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:42:47,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:42:47,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47, skipping insertion in model container [2025-03-13 21:42:47,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:42:47,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4035,4048] [2025-03-13 21:42:47,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:42:47,665 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:42:47,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4035,4048] [2025-03-13 21:42:47,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:42:47,704 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:42:47,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47 WrapperNode [2025-03-13 21:42:47,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:42:47,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:42:47,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:42:47,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:42:47,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,735 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-03-13 21:42:47,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:42:47,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:42:47,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:42:47,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:42:47,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,756 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-13 21:42:47,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:42:47,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:42:47,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:42:47,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:42:47,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (1/1) ... [2025-03-13 21:42:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:42:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:47,811 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-13 21:42:47,816 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-13 21:42:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:42:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:42:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:42:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:42:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:42:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:42:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:42:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:42:47,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:42:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:42:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:42:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:42:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:42:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:42:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:42:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:42:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:42:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:42:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:42:47,837 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:42:47,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:42:47,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:42:48,433 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:42:48,434 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:42:48,434 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:42:48,881 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:42:48,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:42:48 BoogieIcfgContainer [2025-03-13 21:42:48,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:42:48,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:42:48,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:42:48,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:42:48,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:42:47" (1/3) ... [2025-03-13 21:42:48,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5216e480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:42:48, skipping insertion in model container [2025-03-13 21:42:48,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:47" (2/3) ... [2025-03-13 21:42:48,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5216e480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:42:48, skipping insertion in model container [2025-03-13 21:42:48,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:42:48" (3/3) ... [2025-03-13 21:42:48,888 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-03-13 21:42:48,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:42:48,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:42:48,902 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:42:48,954 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:42:48,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-03-13 21:42:49,012 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-13 21:42:49,016 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:42:49,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-13 21:42:49,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-03-13 21:42:49,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-03-13 21:42:49,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:42:49,036 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=LoopHeads, 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;@6864d7ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:42:49,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:42:49,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:42:49,050 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-13 21:42:49,050 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:42:49,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:49,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:49,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1827037519, now seen corresponding path program 1 times [2025-03-13 21:42:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17192015] [2025-03-13 21:42:49,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:49,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:42:49,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:42:49,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:49,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:49,546 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-13 21:42:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17192015] [2025-03-13 21:42:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17192015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:42:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264693] [2025-03-13 21:42:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:49,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:49,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:49,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:49,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-13 21:42:49,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-13 21:42:49,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:49,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-13 21:42:49,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:49,682 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2025-03-13 21:42:49,682 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 21:42:49,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2025-03-13 21:42:49,685 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-03-13 21:42:49,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2025-03-13 21:42:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-03-13 21:42:49,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-03-13 21:42:49,697 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2025-03-13 21:42:49,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2025-03-13 21:42:49,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:42:49,704 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2025-03-13 21:42:49,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2025-03-13 21:42:49,709 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-03-13 21:42:49,710 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2025-03-13 21:42:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-13 21:42:49,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:49,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:49,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:42:49,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:49,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 552778432, now seen corresponding path program 1 times [2025-03-13 21:42:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836513397] [2025-03-13 21:42:49,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:49,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:42:49,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:49,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:49,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:49,980 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-13 21:42:49,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:49,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836513397] [2025-03-13 21:42:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836513397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:49,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299863052] [2025-03-13 21:42:49,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:49,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:49,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:49,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:49,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-13 21:42:49,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 21:42:49,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:49,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-13 21:42:49,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:50,074 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2025-03-13 21:42:50,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:42:50,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 82 conditions per place. [2025-03-13 21:42:50,075 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 25 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2025-03-13 21:42:50,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2025-03-13 21:42:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-13 21:42:50,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-03-13 21:42:50,079 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 44 transitions. [2025-03-13 21:42:50,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2025-03-13 21:42:50,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:50,080 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 82 flow [2025-03-13 21:42:50,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-13 21:42:50,082 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2025-03-13 21:42:50,082 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 82 flow [2025-03-13 21:42:50,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 21:42:50,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:50,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:42:50,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 274854040, now seen corresponding path program 1 times [2025-03-13 21:42:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741404935] [2025-03-13 21:42:50,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:50,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:42:50,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:42:50,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:50,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:50,246 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-13 21:42:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741404935] [2025-03-13 21:42:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741404935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:50,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971461019] [2025-03-13 21:42:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:50,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:50,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:50,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:50,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-13 21:42:50,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 21:42:50,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:50,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-13 21:42:50,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:50,359 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2025-03-13 21:42:50,360 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:42:50,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 85 events. 38/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 172. Up to 83 conditions per place. [2025-03-13 21:42:50,361 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 26 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2025-03-13 21:42:50,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 142 flow [2025-03-13 21:42:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-13 21:42:50,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-03-13 21:42:50,362 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 82 flow. Second operand 4 states and 44 transitions. [2025-03-13 21:42:50,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 142 flow [2025-03-13 21:42:50,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 136 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:50,364 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 90 flow [2025-03-13 21:42:50,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-03-13 21:42:50,364 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-03-13 21:42:50,364 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 90 flow [2025-03-13 21:42:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 21:42:50,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:50,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:50,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:42:50,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash -786339793, now seen corresponding path program 1 times [2025-03-13 21:42:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241631113] [2025-03-13 21:42:50,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:50,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:50,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:50,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:50,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:50,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241631113] [2025-03-13 21:42:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241631113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:50,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:50,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117633284] [2025-03-13 21:42:50,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:50,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:50,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:50,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:50,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-13 21:42:50,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 21:42:50,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:50,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-13 21:42:50,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:50,664 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2025-03-13 21:42:50,665 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:42:50,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 86 events. 38/86 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 177. Up to 84 conditions per place. [2025-03-13 21:42:50,666 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-13 21:42:50,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 152 flow [2025-03-13 21:42:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-13 21:42:50,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-03-13 21:42:50,667 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 90 flow. Second operand 4 states and 44 transitions. [2025-03-13 21:42:50,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 152 flow [2025-03-13 21:42:50,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 146 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:50,668 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 98 flow [2025-03-13 21:42:50,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-03-13 21:42:50,669 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-03-13 21:42:50,669 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 98 flow [2025-03-13 21:42:50,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 21:42:50,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:50,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:42:50,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:50,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 445273649, now seen corresponding path program 1 times [2025-03-13 21:42:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828254128] [2025-03-13 21:42:50,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:42:50,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:42:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828254128] [2025-03-13 21:42:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828254128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968042570] [2025-03-13 21:42:50,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:50,897 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-13 21:42:50,899 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-13 21:42:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:42:51,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:42:51,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:51,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:51,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-13 21:42:51,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:51,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:42:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968042570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:42:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-13 21:42:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964588489] [2025-03-13 21:42:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:51,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:51,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:51,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:42:51,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-13 21:42:51,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 21:42:51,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:51,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-13 21:42:51,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:51,193 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2025-03-13 21:42:51,193 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:42:51,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 87 events. 38/87 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 182. Up to 85 conditions per place. [2025-03-13 21:42:51,194 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-03-13 21:42:51,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 162 flow [2025-03-13 21:42:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-13 21:42:51,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-03-13 21:42:51,196 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 98 flow. Second operand 4 states and 44 transitions. [2025-03-13 21:42:51,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 162 flow [2025-03-13 21:42:51,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:51,198 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow [2025-03-13 21:42:51,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-13 21:42:51,199 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-13 21:42:51,200 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow [2025-03-13 21:42:51,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 21:42:51,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:51,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:51,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:51,401 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-13 21:42:51,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:51,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1737051261, now seen corresponding path program 1 times [2025-03-13 21:42:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-03-13 21:42:51,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:51,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:42:51,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:51,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:51,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 21:42:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:51,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-03-13 21:42:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296084512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:51,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341690196] [2025-03-13 21:42:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:51,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:51,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-13 21:42:51,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 21:42:51,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:51,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-13 21:42:51,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:51,616 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2025-03-13 21:42:51,616 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:42:51,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 88 events. 38/88 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 187. Up to 86 conditions per place. [2025-03-13 21:42:51,617 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-13 21:42:51,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 172 flow [2025-03-13 21:42:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-13 21:42:51,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-03-13 21:42:51,619 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 4 states and 44 transitions. [2025-03-13 21:42:51,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 172 flow [2025-03-13 21:42:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:51,620 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 114 flow [2025-03-13 21:42:51,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-13 21:42:51,621 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-03-13 21:42:51,621 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 114 flow [2025-03-13 21:42:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 21:42:51,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:51,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:42:51,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1645648858, now seen corresponding path program 1 times [2025-03-13 21:42:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902850277] [2025-03-13 21:42:51,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:51,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:51,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 21:42:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902850277] [2025-03-13 21:42:54,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902850277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438887187] [2025-03-13 21:42:54,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:54,935 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-13 21:42:54,936 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-13 21:42:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:55,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:55,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:55,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:55,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-13 21:42:55,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:04,358 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 1262 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-13 21:43:04,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:43:04,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 1343 treesize of output 4487 [2025-03-13 21:43:11,672 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 1122 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-13 21:43:11,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:43:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 639 treesize of output 3219