./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:38:41,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:38:41,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:38:41,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:38:41,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:38:41,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:38:41,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:38:41,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:38:41,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:38:41,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:38:41,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:38:41,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:38:41,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:38:41,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:38:41,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:38:41,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:38:41,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:38:41,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:38:41,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:38:41,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:38:41,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:38:41,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:38:41,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:38:41,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:38:41,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:38:41,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:38:41,924 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-03-08 17:38:42,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:38:42,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:38:42,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:38:42,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:38:42,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:38:42,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-08 17:38:43,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f33a1ac/47ea99ab7e67483085ca661162fe12ca/FLAGa708ed458 [2025-03-08 17:38:43,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:38:43,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-08 17:38:43,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f33a1ac/47ea99ab7e67483085ca661162fe12ca/FLAGa708ed458 [2025-03-08 17:38:43,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f33a1ac/47ea99ab7e67483085ca661162fe12ca [2025-03-08 17:38:43,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:38:43,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:38:43,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:38:43,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:38:43,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:38:43,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:43" (1/1) ... [2025-03-08 17:38:43,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40242edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:43, skipping insertion in model container [2025-03-08 17:38:43,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:43" (1/1) ... [2025-03-08 17:38:43,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:38:44,039 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/popl20-two-queue.wvr.c[3013,3026] [2025-03-08 17:38:44,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:38:44,059 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:38:44,079 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/popl20-two-queue.wvr.c[3013,3026] [2025-03-08 17:38:44,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:38:44,094 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:38:44,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44 WrapperNode [2025-03-08 17:38:44,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:38:44,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:38:44,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:38:44,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:38:44,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,123 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 186 [2025-03-08 17:38:44,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:38:44,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:38:44,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:38:44,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:38:44,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,145 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 17:38:44,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:38:44,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:38:44,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:38:44,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:38:44,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (1/1) ... [2025-03-08 17:38:44,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:38:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:44,179 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-08 17:38:44,181 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-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:38:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:38:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:38:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:38:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:38:44,197 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:38:44,290 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:38:44,291 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:38:44,571 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:38:44,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:38:44,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:38:44,735 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:38:44,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:44 BoogieIcfgContainer [2025-03-08 17:38:44,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:38:44,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:38:44,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:38:44,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:38:44,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:43" (1/3) ... [2025-03-08 17:38:44,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c16078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:44, skipping insertion in model container [2025-03-08 17:38:44,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:44" (2/3) ... [2025-03-08 17:38:44,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c16078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:44, skipping insertion in model container [2025-03-08 17:38:44,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:44" (3/3) ... [2025-03-08 17:38:44,742 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-03-08 17:38:44,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:38:44,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 17:38:44,754 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:38:44,786 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:38:44,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-03-08 17:38:44,838 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-08 17:38:44,840 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:38:44,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-08 17:38:44,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-03-08 17:38:44,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-03-08 17:38:44,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:38:44,865 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;@41daf1e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:38:44,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:38:44,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:38:44,874 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-08 17:38:44,874 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:38:44,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:44,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:44,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:38:44,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 768563539, now seen corresponding path program 1 times [2025-03-08 17:38:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465692042] [2025-03-08 17:38:44,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:44,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:38:44,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:38:44,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:44,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:45,212 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-08 17:38:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465692042] [2025-03-08 17:38:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465692042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:45,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:45,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:38:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305932936] [2025-03-08 17:38:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:38:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:45,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:38:45,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:38:45,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-08 17:38:45,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 17:38:45,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:45,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-08 17:38:45,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:45,339 INFO L124 PetriNetUnfolderBase]: 141/263 cut-off events. [2025-03-08 17:38:45,339 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-08 17:38:45,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 263 events. 141/263 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1060 event pairs, 26 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 458. Up to 181 conditions per place. [2025-03-08 17:38:45,345 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 27 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2025-03-08 17:38:45,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 155 flow [2025-03-08 17:38:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:38:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:38:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-08 17:38:45,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-08 17:38:45,357 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 3 states and 53 transitions. [2025-03-08 17:38:45,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 155 flow [2025-03-08 17:38:45,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:38:45,364 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 73 flow [2025-03-08 17:38:45,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-03-08 17:38:45,368 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2025-03-08 17:38:45,368 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 73 flow [2025-03-08 17:38:45,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 17:38:45,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:45,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:45,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:38:45,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:38:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 23169152, now seen corresponding path program 1 times [2025-03-08 17:38:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803294316] [2025-03-08 17:38:45,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:45,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:38:45,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:38:45,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:45,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:45,498 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-08 17:38:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803294316] [2025-03-08 17:38:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803294316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:38:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614558366] [2025-03-08 17:38:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:45,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:38:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:45,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:38:45,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:38:45,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-08 17:38:45,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08 17:38:45,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:45,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-08 17:38:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:45,609 INFO L124 PetriNetUnfolderBase]: 105/206 cut-off events. [2025-03-08 17:38:45,609 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-08 17:38:45,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 206 events. 105/206 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 732 event pairs, 22 based on Foata normal form. 6/202 useless extension candidates. Maximal degree in co-relation 120. Up to 143 conditions per place. [2025-03-08 17:38:45,611 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2025-03-08 17:38:45,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 147 flow [2025-03-08 17:38:45,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:38:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:38:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-08 17:38:45,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-08 17:38:45,612 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 73 flow. Second operand 3 states and 49 transitions. [2025-03-08 17:38:45,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 147 flow [2025-03-08 17:38:45,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:38:45,613 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 82 flow [2025-03-08 17:38:45,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=82, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-03-08 17:38:45,614 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-03-08 17:38:45,614 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 82 flow [2025-03-08 17:38:45,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08 17:38:45,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:45,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:38:45,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:38:45,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash 178142070, now seen corresponding path program 1 times [2025-03-08 17:38:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155665059] [2025-03-08 17:38:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:45,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:38:45,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:38:45,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:45,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:45,702 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-08 17:38:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155665059] [2025-03-08 17:38:45,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155665059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:45,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:45,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:38:45,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626884636] [2025-03-08 17:38:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:45,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:38:45,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:45,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:38:45,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:38:45,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-08 17:38:45,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08 17:38:45,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:45,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-08 17:38:45,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:45,770 INFO L124 PetriNetUnfolderBase]: 80/166 cut-off events. [2025-03-08 17:38:45,770 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-08 17:38:45,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 166 events. 80/166 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 489 event pairs, 27 based on Foata normal form. 5/163 useless extension candidates. Maximal degree in co-relation 246. Up to 112 conditions per place. [2025-03-08 17:38:45,771 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 26 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2025-03-08 17:38:45,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 170 flow [2025-03-08 17:38:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:38:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:38:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-08 17:38:45,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-08 17:38:45,772 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 82 flow. Second operand 3 states and 51 transitions. [2025-03-08 17:38:45,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 170 flow [2025-03-08 17:38:45,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:38:45,773 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 92 flow [2025-03-08 17:38:45,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-08 17:38:45,773 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-03-08 17:38:45,773 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 92 flow [2025-03-08 17:38:45,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08 17:38:45,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:45,774 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-08 17:38:45,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:38:45,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:38:45,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:45,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1380778259, now seen corresponding path program 1 times [2025-03-08 17:38:45,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:45,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556768709] [2025-03-08 17:38:45,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:45,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:45,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:38:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:38:45,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:45,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:45,904 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-08 17:38:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556768709] [2025-03-08 17:38:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556768709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:38:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862582641] [2025-03-08 17:38:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:45,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:38:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:45,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:38:45,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:38:45,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-08 17:38:45,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08 17:38:45,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:45,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-08 17:38:45,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:45,981 INFO L124 PetriNetUnfolderBase]: 95/216 cut-off events. [2025-03-08 17:38:45,981 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-08 17:38:45,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 216 events. 95/216 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 821 event pairs, 67 based on Foata normal form. 3/207 useless extension candidates. Maximal degree in co-relation 266. Up to 150 conditions per place. [2025-03-08 17:38:45,984 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 23 selfloop transitions, 2 changer transitions 12/42 dead transitions. [2025-03-08 17:38:45,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 199 flow [2025-03-08 17:38:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:38:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:38:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-08 17:38:45,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-03-08 17:38:45,985 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 92 flow. Second operand 4 states and 62 transitions. [2025-03-08 17:38:45,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 199 flow [2025-03-08 17:38:45,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:38:45,986 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 104 flow [2025-03-08 17:38:45,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-08 17:38:45,987 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2025-03-08 17:38:45,987 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 104 flow [2025-03-08 17:38:45,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08 17:38:45,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:45,987 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-08 17:38:45,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:38:45,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:38:45,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:45,987 INFO L85 PathProgramCache]: Analyzing trace with hash -225535420, now seen corresponding path program 1 times [2025-03-08 17:38:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:45,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6516411] [2025-03-08 17:38:45,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:45,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:45,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:38:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:38:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:46,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:46,087 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-08 17:38:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6516411] [2025-03-08 17:38:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6516411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:46,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:46,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:38:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161288682] [2025-03-08 17:38:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:46,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:38:46,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:46,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:38:46,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:38:46,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-08 17:38:46,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-08 17:38:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-08 17:38:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:46,144 INFO L124 PetriNetUnfolderBase]: 93/211 cut-off events. [2025-03-08 17:38:46,144 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-08 17:38:46,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 211 events. 93/211 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 772 event pairs, 66 based on Foata normal form. 7/206 useless extension candidates. Maximal degree in co-relation 476. Up to 151 conditions per place. [2025-03-08 17:38:46,145 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 24 selfloop transitions, 2 changer transitions 10/41 dead transitions. [2025-03-08 17:38:46,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 206 flow [2025-03-08 17:38:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:38:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:38:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-08 17:38:46,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-08 17:38:46,147 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 104 flow. Second operand 4 states and 60 transitions. [2025-03-08 17:38:46,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 206 flow [2025-03-08 17:38:46,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 198 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:38:46,148 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 112 flow [2025-03-08 17:38:46,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-03-08 17:38:46,149 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2025-03-08 17:38:46,149 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 112 flow [2025-03-08 17:38:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-08 17:38:46,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:46,149 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-08 17:38:46,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:38:46,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:38:46,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash -317948351, now seen corresponding path program 1 times [2025-03-08 17:38:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058389876] [2025-03-08 17:38:46,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:46,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:38:46,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:38:46,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:46,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:47,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:47,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058389876] [2025-03-08 17:38:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058389876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499004889] [2025-03-08 17:38:47,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:47,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:47,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:47,354 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-08 17:38:47,355 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-08 17:38:47,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:38:47,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:38:47,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:47,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:47,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 17:38:47,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:38:47,482 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-08 17:38:47,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-08 17:38:47,615 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 17:38:47,616 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-08 17:38:47,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-08 17:38:48,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-03-08 17:38:48,326 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-08 17:38:48,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:38:53,669 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-03-08 17:38:53,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 298 [2025-03-08 17:38:53,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:38:53,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 223 [2025-03-08 17:38:53,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-03-08 17:38:54,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:38:54,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 285 [2025-03-08 17:38:54,967 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-03-08 17:38:54,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 733 treesize of output 643 [2025-03-08 17:38:54,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:38:54,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 429 treesize of output 415 [2025-03-08 17:38:55,174 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 38 treesize of output 32 [2025-03-08 17:38:55,197 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 38 treesize of output 32 [2025-03-08 17:38:55,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:38:55,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 241 [2025-03-08 17:38:57,074 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-08 17:38:57,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499004889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:38:57,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:38:57,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-03-08 17:38:57,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310012431] [2025-03-08 17:38:57,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:38:57,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 17:38:57,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:57,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 17:38:57,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1495, Unknown=1, NotChecked=0, Total=1640 [2025-03-08 17:38:57,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-08 17:38:57,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 112 flow. Second operand has 41 states, 41 states have (on average 6.560975609756097) internal successors, (269), 41 states have internal predecessors, (269), 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-08 17:38:57,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:57,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-08 17:38:57,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:39:02,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:08,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:21,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:30,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:40,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:45,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 17:39:50,299 INFO L124 PetriNetUnfolderBase]: 577/1091 cut-off events. [2025-03-08 17:39:50,300 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2025-03-08 17:39:50,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 1091 events. 577/1091 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5354 event pairs, 37 based on Foata normal form. 2/936 useless extension candidates. Maximal degree in co-relation 1744. Up to 198 conditions per place. [2025-03-08 17:39:50,304 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 139 selfloop transitions, 126 changer transitions 42/310 dead transitions. [2025-03-08 17:39:50,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 310 transitions, 1558 flow [2025-03-08 17:39:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-08 17:39:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-08 17:39:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 604 transitions. [2025-03-08 17:39:50,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36561743341404357 [2025-03-08 17:39:50,308 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 112 flow. Second operand 59 states and 604 transitions. [2025-03-08 17:39:50,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 310 transitions, 1558 flow [2025-03-08 17:39:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 310 transitions, 1526 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-08 17:39:50,313 INFO L231 Difference]: Finished difference. Result has 113 places, 163 transitions, 1046 flow [2025-03-08 17:39:50,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=1046, PETRI_PLACES=113, PETRI_TRANSITIONS=163} [2025-03-08 17:39:50,314 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 85 predicate places. [2025-03-08 17:39:50,314 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 163 transitions, 1046 flow [2025-03-08 17:39:50,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.560975609756097) internal successors, (269), 41 states have internal predecessors, (269), 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-08 17:39:50,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:39:50,314 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-08 17:39:50,321 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-08 17:39:50,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 17:39:50,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:39:50,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:39:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -96043553, now seen corresponding path program 2 times [2025-03-08 17:39:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:39:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851680784] [2025-03-08 17:39:50,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:39:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:39:50,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:39:50,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-08 17:39:50,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:39:50,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:39:51,218 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-08 17:39:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:39:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851680784] [2025-03-08 17:39:51,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851680784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:39:51,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:39:51,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:39:51,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458095395] [2025-03-08 17:39:51,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:39:51,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:39:51,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:39:51,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:39:51,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:39:51,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-08 17:39:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 163 transitions, 1046 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-08 17:39:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:39:51,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-08 17:39:51,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:39:52,168 INFO L124 PetriNetUnfolderBase]: 652/1210 cut-off events. [2025-03-08 17:39:52,168 INFO L125 PetriNetUnfolderBase]: For 7542/7542 co-relation queries the response was YES. [2025-03-08 17:39:52,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 1210 events. 652/1210 cut-off events. For 7542/7542 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5951 event pairs, 94 based on Foata normal form. 1/1184 useless extension candidates. Maximal degree in co-relation 4173. Up to 707 conditions per place. [2025-03-08 17:39:52,179 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 151 selfloop transitions, 59 changer transitions 8/221 dead transitions. [2025-03-08 17:39:52,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 221 transitions, 1908 flow [2025-03-08 17:39:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:39:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:39:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-08 17:39:52,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2025-03-08 17:39:52,181 INFO L175 Difference]: Start difference. First operand has 113 places, 163 transitions, 1046 flow. Second operand 11 states and 135 transitions. [2025-03-08 17:39:52,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 221 transitions, 1908 flow [2025-03-08 17:39:52,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 221 transitions, 1746 flow, removed 79 selfloop flow, removed 2 redundant places. [2025-03-08 17:39:52,216 INFO L231 Difference]: Finished difference. Result has 122 places, 184 transitions, 1257 flow [2025-03-08 17:39:52,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1257, PETRI_PLACES=122, PETRI_TRANSITIONS=184} [2025-03-08 17:39:52,216 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 94 predicate places. [2025-03-08 17:39:52,218 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 184 transitions, 1257 flow [2025-03-08 17:39:52,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-08 17:39:52,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:39:52,218 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-08 17:39:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:39:52,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:39:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:39:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 979667603, now seen corresponding path program 3 times [2025-03-08 17:39:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:39:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973737056] [2025-03-08 17:39:52,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:39:52,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:39:52,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:39:52,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-08 17:39:52,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:39:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:39:52,919 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-08 17:39:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:39:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973737056] [2025-03-08 17:39:52,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973737056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:39:52,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:39:52,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:39:52,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129059309] [2025-03-08 17:39:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:39:52,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:39:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:39:52,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:39:52,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:39:53,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-08 17:39:53,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 184 transitions, 1257 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-08 17:39:53,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:39:53,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-08 17:39:53,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:39:53,860 INFO L124 PetriNetUnfolderBase]: 728/1339 cut-off events. [2025-03-08 17:39:53,860 INFO L125 PetriNetUnfolderBase]: For 9773/9773 co-relation queries the response was YES. [2025-03-08 17:39:53,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6682 conditions, 1339 events. 728/1339 cut-off events. For 9773/9773 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6738 event pairs, 83 based on Foata normal form. 1/1313 useless extension candidates. Maximal degree in co-relation 6418. Up to 851 conditions per place. [2025-03-08 17:39:53,871 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 166 selfloop transitions, 62 changer transitions 8/239 dead transitions. [2025-03-08 17:39:53,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 239 transitions, 2154 flow [2025-03-08 17:39:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:39:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:39:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-08 17:39:53,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2025-03-08 17:39:53,872 INFO L175 Difference]: Start difference. First operand has 122 places, 184 transitions, 1257 flow. Second operand 11 states and 135 transitions. [2025-03-08 17:39:53,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 239 transitions, 2154 flow [2025-03-08 17:39:53,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 239 transitions, 2112 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-08 17:39:53,896 INFO L231 Difference]: Finished difference. Result has 135 places, 202 transitions, 1582 flow [2025-03-08 17:39:53,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1582, PETRI_PLACES=135, PETRI_TRANSITIONS=202} [2025-03-08 17:39:53,897 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 107 predicate places. [2025-03-08 17:39:53,897 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 202 transitions, 1582 flow [2025-03-08 17:39:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-08 17:39:53,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:39:53,899 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-08 17:39:53,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:39:53,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:39:53,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:39:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1042349825, now seen corresponding path program 4 times [2025-03-08 17:39:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:39:53,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096182212] [2025-03-08 17:39:53,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:39:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:39:53,906 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:39:53,930 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:39:53,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:39:53,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:39:56,410 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-08 17:39:56,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:39:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096182212] [2025-03-08 17:39:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096182212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:39:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269656192] [2025-03-08 17:39:56,410 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:39:56,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:39:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:39:56,412 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-08 17:39:56,414 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-08 17:39:56,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:39:56,480 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:39:56,480 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:39:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:39:56,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 17:39:56,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:39:56,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-08 17:39:57,689 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-08 17:39:57,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 20 [2025-03-08 17:39:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:39:57,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:39:59,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:39:59,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2025-03-08 17:40:00,075 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:40:00,075 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 22 treesize of output 13 [2025-03-08 17:40:00,140 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:40:00,141 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 22 treesize of output 13 [2025-03-08 17:40:00,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 17:40:00,198 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 22 treesize of output 1 [2025-03-08 17:40:00,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:40:00,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 17:40:00,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:40:00,455 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-08 17:40:00,472 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 17:40:00,472 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 35 treesize of output 1 [2025-03-08 17:40:00,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:40:00,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-08 17:40:01,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:40:01,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 285 treesize of output 551 [2025-03-08 17:40:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:40:14,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269656192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:40:14,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:40:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 39 [2025-03-08 17:40:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363697262] [2025-03-08 17:40:14,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:40:14,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 17:40:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 17:40:14,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 17:40:14,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-08 17:40:14,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 202 transitions, 1582 flow. Second operand has 40 states, 40 states have (on average 6.575) internal successors, (263), 40 states have internal predecessors, (263), 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-08 17:40:14,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:14,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-08 17:40:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand