/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:55:49,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:55:49,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:55:49,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:55:49,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:55:49,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:55:49,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:55:49,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:55:49,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:55:49,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:55:49,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:55:49,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:55:49,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:55:49,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:55:49,702 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:55:49,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:55:49,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:55:49,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:55:49,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:49,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:55:49,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:49,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:55:49,704 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:55:49,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:55:49,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:55:49,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:55:49,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:55:49,909 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:55:49,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-13 20:55:51,235 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0758fd72/7660ffc8eb574e458e400b2184fb89f1/FLAG32fc20169 [2025-04-13 20:55:51,442 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:55:51,442 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-13 20:55:51,450 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0758fd72/7660ffc8eb574e458e400b2184fb89f1/FLAG32fc20169 [2025-04-13 20:55:52,235 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0758fd72/7660ffc8eb574e458e400b2184fb89f1 [2025-04-13 20:55:52,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:55:52,237 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:55:52,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:55:52,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:55:52,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:55:52,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d135bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52, skipping insertion in model container [2025-04-13 20:55:52,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:55:52,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-04-13 20:55:52,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:55:52,427 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:55:52,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-04-13 20:55:52,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:55:52,478 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:55:52,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52 WrapperNode [2025-04-13 20:55:52,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:55:52,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:55:52,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:55:52,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:55:52,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,512 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-04-13 20:55:52,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:55:52,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:55:52,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:55:52,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:55:52,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,540 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 3 writes are split as follows [0, 3]. [2025-04-13 20:55:52,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:55:52,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:55:52,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:55:52,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:55:52,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (1/1) ... [2025-04-13 20:55:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:52,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:52,585 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-04-13 20:55:52,587 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-04-13 20:55:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:55:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:55:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:55:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:55:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:55:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:55:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:55:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:55:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:55:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:55:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:55:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:55:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:55:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:55:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:55:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:55:52,605 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:55:52,675 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:55:52,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:55:52,862 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:55:52,863 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:55:52,863 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:55:53,050 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:55:53,051 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:55:53,054 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:55:53,059 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:55:53,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:55:53 BoogieIcfgContainer [2025-04-13 20:55:53,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:55:53,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:55:53,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:55:53,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:55:53,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:55:52" (1/3) ... [2025-04-13 20:55:53,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55715ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:55:53, skipping insertion in model container [2025-04-13 20:55:53,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:52" (2/3) ... [2025-04-13 20:55:53,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55715ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:55:53, skipping insertion in model container [2025-04-13 20:55:53,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:55:53" (3/3) ... [2025-04-13 20:55:53,065 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-04-13 20:55:53,076 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:55:53,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 31 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 20:55:53,077 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:55:53,123 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:55:53,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 107 flow [2025-04-13 20:55:53,173 INFO L116 PetriNetUnfolderBase]: 12/40 cut-off events. [2025-04-13 20:55:53,175 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:55:53,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 12/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-04-13 20:55:53,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 107 flow [2025-04-13 20:55:53,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 39 transitions, 96 flow [2025-04-13 20:55:53,189 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:55:53,199 INFO L340 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;@6bafdca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:55:53,199 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:55:53,210 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:55:53,210 INFO L116 PetriNetUnfolderBase]: 12/38 cut-off events. [2025-04-13 20:55:53,210 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:55:53,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:53,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:53,211 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:53,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1830169544, now seen corresponding path program 1 times [2025-04-13 20:55:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:53,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041551727] [2025-04-13 20:55:53,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:53,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:55:53,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:55:53,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:53,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:53,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041551727] [2025-04-13 20:55:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041551727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:53,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:55:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043182762] [2025-04-13 20:55:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:53,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:53,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:53,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:53,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:55:53,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-04-13 20:55:53,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:53,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:55:53,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:54,212 INFO L116 PetriNetUnfolderBase]: 1814/2448 cut-off events. [2025-04-13 20:55:54,213 INFO L117 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-04-13 20:55:54,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 2448 events. 1814/2448 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9482 event pairs, 280 based on Foata normal form. 1/1651 useless extension candidates. Maximal degree in co-relation 4506. Up to 1434 conditions per place. [2025-04-13 20:55:54,229 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 64 selfloop transitions, 10 changer transitions 8/84 dead transitions. [2025-04-13 20:55:54,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 84 transitions, 371 flow [2025-04-13 20:55:54,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:55:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:55:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-13 20:55:54,240 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6337209302325582 [2025-04-13 20:55:54,241 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 96 flow. Second operand 4 states and 109 transitions. [2025-04-13 20:55:54,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 84 transitions, 371 flow [2025-04-13 20:55:54,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 84 transitions, 345 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:55:54,252 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 139 flow [2025-04-13 20:55:54,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2025-04-13 20:55:54,257 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-04-13 20:55:54,257 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 139 flow [2025-04-13 20:55:54,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-04-13 20:55:54,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:54,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:54,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:55:54,258 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:54,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash 313329771, now seen corresponding path program 1 times [2025-04-13 20:55:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:54,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976001385] [2025-04-13 20:55:54,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:54,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:55:54,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:55:54,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:54,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:54,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976001385] [2025-04-13 20:55:54,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976001385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:54,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:54,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:54,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507123009] [2025-04-13 20:55:54,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:54,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:54,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:54,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:54,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:54,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 139 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-04-13 20:55:54,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:54,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:54,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:54,534 INFO L116 PetriNetUnfolderBase]: 1433/2035 cut-off events. [2025-04-13 20:55:54,535 INFO L117 PetriNetUnfolderBase]: For 500/508 co-relation queries the response was YES. [2025-04-13 20:55:54,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2035 events. 1433/2035 cut-off events. For 500/508 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8599 event pairs, 499 based on Foata normal form. 68/1734 useless extension candidates. Maximal degree in co-relation 3269. Up to 1392 conditions per place. [2025-04-13 20:55:54,547 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 48 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-04-13 20:55:54,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 289 flow [2025-04-13 20:55:54,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-13 20:55:54,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2025-04-13 20:55:54,549 INFO L175 Difference]: Start difference. First operand has 36 places, 43 transitions, 139 flow. Second operand 3 states and 68 transitions. [2025-04-13 20:55:54,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 289 flow [2025-04-13 20:55:54,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:55:54,550 INFO L231 Difference]: Finished difference. Result has 38 places, 45 transitions, 180 flow [2025-04-13 20:55:54,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=38, PETRI_TRANSITIONS=45} [2025-04-13 20:55:54,551 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-13 20:55:54,551 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 45 transitions, 180 flow [2025-04-13 20:55:54,551 INFO L486 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-04-13 20:55:54,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:54,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:54,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:55:54,552 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:54,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1526914445, now seen corresponding path program 2 times [2025-04-13 20:55:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:54,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970654891] [2025-04-13 20:55:54,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:55:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:54,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:55:54,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:55:54,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:55:54,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:54,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970654891] [2025-04-13 20:55:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970654891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:54,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:54,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080104916] [2025-04-13 20:55:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:54,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:54,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:54,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:54,618 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:54,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 45 transitions, 180 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-04-13 20:55:54,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:54,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:54,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:54,825 INFO L116 PetriNetUnfolderBase]: 1530/2238 cut-off events. [2025-04-13 20:55:54,826 INFO L117 PetriNetUnfolderBase]: For 1267/1271 co-relation queries the response was YES. [2025-04-13 20:55:54,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5989 conditions, 2238 events. 1530/2238 cut-off events. For 1267/1271 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9710 event pairs, 714 based on Foata normal form. 79/1900 useless extension candidates. Maximal degree in co-relation 4945. Up to 1413 conditions per place. [2025-04-13 20:55:54,838 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 52 selfloop transitions, 5 changer transitions 3/65 dead transitions. [2025-04-13 20:55:54,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 353 flow [2025-04-13 20:55:54,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-13 20:55:54,840 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2025-04-13 20:55:54,840 INFO L175 Difference]: Start difference. First operand has 38 places, 45 transitions, 180 flow. Second operand 3 states and 74 transitions. [2025-04-13 20:55:54,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 353 flow [2025-04-13 20:55:54,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:54,842 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 199 flow [2025-04-13 20:55:54,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-04-13 20:55:54,843 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-13 20:55:54,843 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 199 flow [2025-04-13 20:55:54,843 INFO L486 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-04-13 20:55:54,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:54,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:54,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:55:54,843 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:54,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1379009455, now seen corresponding path program 3 times [2025-04-13 20:55:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:54,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979180937] [2025-04-13 20:55:54,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:55:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:54,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:55:54,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:55:54,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:55:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:54,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979180937] [2025-04-13 20:55:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979180937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:55:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756239906] [2025-04-13 20:55:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:54,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:54,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:54,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:54,926 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:54,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04-13 20:55:54,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:54,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:54,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:55,083 INFO L116 PetriNetUnfolderBase]: 1068/1624 cut-off events. [2025-04-13 20:55:55,083 INFO L117 PetriNetUnfolderBase]: For 2147/2147 co-relation queries the response was YES. [2025-04-13 20:55:55,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 1624 events. 1068/1624 cut-off events. For 2147/2147 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6921 event pairs, 295 based on Foata normal form. 158/1472 useless extension candidates. Maximal degree in co-relation 4087. Up to 933 conditions per place. [2025-04-13 20:55:55,091 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 47 selfloop transitions, 8 changer transitions 8/67 dead transitions. [2025-04-13 20:55:55,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 363 flow [2025-04-13 20:55:55,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:55:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:55:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-13 20:55:55,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:55:55,094 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 199 flow. Second operand 4 states and 86 transitions. [2025-04-13 20:55:55,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 363 flow [2025-04-13 20:55:55,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 345 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:55,098 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 155 flow [2025-04-13 20:55:55,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-04-13 20:55:55,099 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2025-04-13 20:55:55,099 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 155 flow [2025-04-13 20:55:55,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04-13 20:55:55,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:55,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:55,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:55:55,100 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:55,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash 390680930, now seen corresponding path program 1 times [2025-04-13 20:55:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:55,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245043995] [2025-04-13 20:55:55,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:55,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:55,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:55:55,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:55:55,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:55,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:55,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245043995] [2025-04-13 20:55:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245043995] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:55:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863424829] [2025-04-13 20:55:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:55,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:55,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:55,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:55,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:55,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:55:55,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:55,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:55,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:55:55,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:55,277 INFO L116 PetriNetUnfolderBase]: 1229/1851 cut-off events. [2025-04-13 20:55:55,277 INFO L117 PetriNetUnfolderBase]: For 1716/1716 co-relation queries the response was YES. [2025-04-13 20:55:55,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 1851 events. 1229/1851 cut-off events. For 1716/1716 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7283 event pairs, 337 based on Foata normal form. 52/1577 useless extension candidates. Maximal degree in co-relation 5062. Up to 1406 conditions per place. [2025-04-13 20:55:55,288 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-04-13 20:55:55,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 298 flow [2025-04-13 20:55:55,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-13 20:55:55,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2025-04-13 20:55:55,291 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 155 flow. Second operand 3 states and 56 transitions. [2025-04-13 20:55:55,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 298 flow [2025-04-13 20:55:55,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 283 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:55,293 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 148 flow [2025-04-13 20:55:55,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-04-13 20:55:55,293 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-13 20:55:55,293 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 148 flow [2025-04-13 20:55:55,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:55,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:55,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:55,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:55:55,294 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:55,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1528058912, now seen corresponding path program 2 times [2025-04-13 20:55:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:55,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733139352] [2025-04-13 20:55:55,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:55:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:55,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:55:55,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:55:55,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:55:55,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:55,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733139352] [2025-04-13 20:55:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733139352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:55,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:55:55,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496369337] [2025-04-13 20:55:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:55,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:55,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:55,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:55,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:55:55,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-04-13 20:55:55,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:55,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:55:55,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:55,546 INFO L116 PetriNetUnfolderBase]: 1464/2244 cut-off events. [2025-04-13 20:55:55,546 INFO L117 PetriNetUnfolderBase]: For 2123/2123 co-relation queries the response was YES. [2025-04-13 20:55:55,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6216 conditions, 2244 events. 1464/2244 cut-off events. For 2123/2123 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9007 event pairs, 372 based on Foata normal form. 66/1925 useless extension candidates. Maximal degree in co-relation 1640. Up to 1406 conditions per place. [2025-04-13 20:55:55,557 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 57 selfloop transitions, 5 changer transitions 2/67 dead transitions. [2025-04-13 20:55:55,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 385 flow [2025-04-13 20:55:55,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:55:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:55:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-13 20:55:55,558 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2025-04-13 20:55:55,559 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 148 flow. Second operand 4 states and 76 transitions. [2025-04-13 20:55:55,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 385 flow [2025-04-13 20:55:55,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 381 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:55,561 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 178 flow [2025-04-13 20:55:55,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-04-13 20:55:55,561 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-04-13 20:55:55,562 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 178 flow [2025-04-13 20:55:55,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-04-13 20:55:55,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:55,562 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:55,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:55:55,563 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:55,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 781688788, now seen corresponding path program 1 times [2025-04-13 20:55:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:55,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102327632] [2025-04-13 20:55:55,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:55,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:55:55,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:55:55,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:55,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:55,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102327632] [2025-04-13 20:55:55,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102327632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:55,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:55,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934192436] [2025-04-13 20:55:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:55,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:55,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:55,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:55,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:55,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-04-13 20:55:55,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:55,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:55,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:55,826 INFO L116 PetriNetUnfolderBase]: 1280/1996 cut-off events. [2025-04-13 20:55:55,827 INFO L117 PetriNetUnfolderBase]: For 2332/2332 co-relation queries the response was YES. [2025-04-13 20:55:55,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 1996 events. 1280/1996 cut-off events. For 2332/2332 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8056 event pairs, 837 based on Foata normal form. 10/1646 useless extension candidates. Maximal degree in co-relation 2490. Up to 1769 conditions per place. [2025-04-13 20:55:55,836 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 4 changer transitions 10/53 dead transitions. [2025-04-13 20:55:55,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 299 flow [2025-04-13 20:55:55,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:55:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:55:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-13 20:55:55,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33488372093023255 [2025-04-13 20:55:55,838 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 178 flow. Second operand 5 states and 72 transitions. [2025-04-13 20:55:55,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 299 flow [2025-04-13 20:55:55,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:55,841 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 204 flow [2025-04-13 20:55:55,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-04-13 20:55:55,841 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-04-13 20:55:55,841 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 204 flow [2025-04-13 20:55:55,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-04-13 20:55:55,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:55,843 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:55,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:55:55,843 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:55,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1579008250, now seen corresponding path program 1 times [2025-04-13 20:55:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:55,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918217707] [2025-04-13 20:55:55,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:55,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 20:55:55,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:55,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:55,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:55,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918217707] [2025-04-13 20:55:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918217707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:55:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861163122] [2025-04-13 20:55:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:55,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:55:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:55:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:55:55,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:55,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:55:55,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:55,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:55,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:56,145 INFO L116 PetriNetUnfolderBase]: 1411/2272 cut-off events. [2025-04-13 20:55:56,145 INFO L117 PetriNetUnfolderBase]: For 2556/2556 co-relation queries the response was YES. [2025-04-13 20:55:56,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 2272 events. 1411/2272 cut-off events. For 2556/2556 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10215 event pairs, 674 based on Foata normal form. 5/1892 useless extension candidates. Maximal degree in co-relation 6539. Up to 1093 conditions per place. [2025-04-13 20:55:56,159 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 63 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2025-04-13 20:55:56,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 499 flow [2025-04-13 20:55:56,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:55:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:55:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-13 20:55:56,160 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2025-04-13 20:55:56,160 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 204 flow. Second operand 5 states and 100 transitions. [2025-04-13 20:55:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 499 flow [2025-04-13 20:55:56,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 489 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 20:55:56,164 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 212 flow [2025-04-13 20:55:56,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2025-04-13 20:55:56,165 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2025-04-13 20:55:56,165 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 212 flow [2025-04-13 20:55:56,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:55:56,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:56,165 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:56,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:55:56,165 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:56,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -192912312, now seen corresponding path program 2 times [2025-04-13 20:55:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:56,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178203788] [2025-04-13 20:55:56,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:55:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:56,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:55:56,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:56,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:56,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:56,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178203788] [2025-04-13 20:55:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178203788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:56,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:55:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600757980] [2025-04-13 20:55:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:56,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:55:56,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:56,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:55:56,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:55:56,295 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:55:56,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04-13 20:55:56,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:56,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:55:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:56,673 INFO L116 PetriNetUnfolderBase]: 2634/3979 cut-off events. [2025-04-13 20:55:56,673 INFO L117 PetriNetUnfolderBase]: For 8372/8372 co-relation queries the response was YES. [2025-04-13 20:55:56,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12682 conditions, 3979 events. 2634/3979 cut-off events. For 8372/8372 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18433 event pairs, 670 based on Foata normal form. 60/3669 useless extension candidates. Maximal degree in co-relation 12645. Up to 2002 conditions per place. [2025-04-13 20:55:56,690 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 94 selfloop transitions, 32 changer transitions 0/129 dead transitions. [2025-04-13 20:55:56,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 129 transitions, 863 flow [2025-04-13 20:55:56,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:55:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:55:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-04-13 20:55:56,691 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2025-04-13 20:55:56,691 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 212 flow. Second operand 8 states and 144 transitions. [2025-04-13 20:55:56,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 129 transitions, 863 flow [2025-04-13 20:55:56,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 129 transitions, 821 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 20:55:56,697 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 514 flow [2025-04-13 20:55:56,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2025-04-13 20:55:56,698 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-04-13 20:55:56,698 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 514 flow [2025-04-13 20:55:56,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04-13 20:55:56,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:56,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:56,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:55:56,698 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:56,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 366514802, now seen corresponding path program 3 times [2025-04-13 20:55:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:56,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684434046] [2025-04-13 20:55:56,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:55:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:56,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:55:56,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:56,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:55:56,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:56,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:56,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684434046] [2025-04-13 20:55:56,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684434046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:56,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:56,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:55:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368608499] [2025-04-13 20:55:56,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:56,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:55:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:56,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:55:56,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:55:56,818 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:56,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 514 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:55:56,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:56,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:56,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:57,075 INFO L116 PetriNetUnfolderBase]: 2399/3733 cut-off events. [2025-04-13 20:55:57,075 INFO L117 PetriNetUnfolderBase]: For 10149/10194 co-relation queries the response was YES. [2025-04-13 20:55:57,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13458 conditions, 3733 events. 2399/3733 cut-off events. For 10149/10194 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18192 event pairs, 859 based on Foata normal form. 16/3501 useless extension candidates. Maximal degree in co-relation 13417. Up to 1798 conditions per place. [2025-04-13 20:55:57,093 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 57 selfloop transitions, 26 changer transitions 8/100 dead transitions. [2025-04-13 20:55:57,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 829 flow [2025-04-13 20:55:57,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:55:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:55:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-04-13 20:55:57,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4232558139534884 [2025-04-13 20:55:57,094 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 514 flow. Second operand 5 states and 91 transitions. [2025-04-13 20:55:57,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 829 flow [2025-04-13 20:55:57,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 761 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:57,113 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 538 flow [2025-04-13 20:55:57,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=538, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2025-04-13 20:55:57,116 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2025-04-13 20:55:57,117 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 538 flow [2025-04-13 20:55:57,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:55:57,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:57,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:57,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:55:57,118 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:57,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1480271180, now seen corresponding path program 4 times [2025-04-13 20:55:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:57,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739546388] [2025-04-13 20:55:57,118 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:55:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:57,127 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:55:57,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-04-13 20:55:57,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:55:57,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:57,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739546388] [2025-04-13 20:55:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739546388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:57,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517397637] [2025-04-13 20:55:57,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:55:57,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:57,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:57,173 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-04-13 20:55:57,174 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-04-13 20:55:57,224 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:55:57,239 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-04-13 20:55:57,239 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:55:57,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:57,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:55:57,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:57,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517397637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:57,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-13 20:55:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109015008] [2025-04-13 20:55:57,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:57,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:55:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:57,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:55:57,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:55:57,327 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:57,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:57,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:57,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:57,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:57,686 INFO L116 PetriNetUnfolderBase]: 2697/4182 cut-off events. [2025-04-13 20:55:57,686 INFO L117 PetriNetUnfolderBase]: For 11070/11115 co-relation queries the response was YES. [2025-04-13 20:55:57,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14895 conditions, 4182 events. 2697/4182 cut-off events. For 11070/11115 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20787 event pairs, 956 based on Foata normal form. 40/3954 useless extension candidates. Maximal degree in co-relation 14852. Up to 1877 conditions per place. [2025-04-13 20:55:57,709 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 76 selfloop transitions, 34 changer transitions 0/119 dead transitions. [2025-04-13 20:55:57,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 955 flow [2025-04-13 20:55:57,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:55:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:55:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-04-13 20:55:57,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.437984496124031 [2025-04-13 20:55:57,710 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 538 flow. Second operand 6 states and 113 transitions. [2025-04-13 20:55:57,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 955 flow [2025-04-13 20:55:57,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 921 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:57,731 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 655 flow [2025-04-13 20:55:57,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2025-04-13 20:55:57,732 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2025-04-13 20:55:57,732 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 80 transitions, 655 flow [2025-04-13 20:55:57,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:57,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:57,732 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:57,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:55:57,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 20:55:57,935 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:57,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash 748175078, now seen corresponding path program 5 times [2025-04-13 20:55:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:57,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712562476] [2025-04-13 20:55:57,936 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:55:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:57,949 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:55:57,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:57,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:57,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:58,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712562476] [2025-04-13 20:55:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712562476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:58,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:58,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:55:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464901560] [2025-04-13 20:55:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:58,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:55:58,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:58,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:55:58,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:55:58,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:58,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 80 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:55:58,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:58,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:58,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:58,380 INFO L116 PetriNetUnfolderBase]: 2698/4177 cut-off events. [2025-04-13 20:55:58,380 INFO L117 PetriNetUnfolderBase]: For 13748/13781 co-relation queries the response was YES. [2025-04-13 20:55:58,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15108 conditions, 4177 events. 2698/4177 cut-off events. For 13748/13781 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20873 event pairs, 539 based on Foata normal form. 40/3947 useless extension candidates. Maximal degree in co-relation 15065. Up to 1505 conditions per place. [2025-04-13 20:55:58,398 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 86 selfloop transitions, 25 changer transitions 0/120 dead transitions. [2025-04-13 20:55:58,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 1087 flow [2025-04-13 20:55:58,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:55:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:55:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-13 20:55:58,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44651162790697674 [2025-04-13 20:55:58,399 INFO L175 Difference]: Start difference. First operand has 67 places, 80 transitions, 655 flow. Second operand 5 states and 96 transitions. [2025-04-13 20:55:58,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 1087 flow [2025-04-13 20:55:58,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 1013 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:55:58,414 INFO L231 Difference]: Finished difference. Result has 71 places, 87 transitions, 760 flow [2025-04-13 20:55:58,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=760, PETRI_PLACES=71, PETRI_TRANSITIONS=87} [2025-04-13 20:55:58,415 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2025-04-13 20:55:58,415 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 760 flow [2025-04-13 20:55:58,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:55:58,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:58,415 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:58,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:55:58,415 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:58,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash 111998738, now seen corresponding path program 6 times [2025-04-13 20:55:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:58,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925285657] [2025-04-13 20:55:58,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:55:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:58,427 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:55:58,443 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:58,443 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:55:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:58,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925285657] [2025-04-13 20:55:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925285657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:58,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:55:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201108668] [2025-04-13 20:55:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:58,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:55:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:58,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:55:58,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:55:58,516 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:55:58,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04-13 20:55:58,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:58,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:55:58,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:59,007 INFO L116 PetriNetUnfolderBase]: 3600/5442 cut-off events. [2025-04-13 20:55:59,007 INFO L117 PetriNetUnfolderBase]: For 23549/23549 co-relation queries the response was YES. [2025-04-13 20:55:59,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20585 conditions, 5442 events. 3600/5442 cut-off events. For 23549/23549 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 26355 event pairs, 335 based on Foata normal form. 156/5292 useless extension candidates. Maximal degree in co-relation 20539. Up to 2147 conditions per place. [2025-04-13 20:55:59,032 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 141 selfloop transitions, 34 changer transitions 2/180 dead transitions. [2025-04-13 20:55:59,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 180 transitions, 1754 flow [2025-04-13 20:55:59,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:55:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:55:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2025-04-13 20:55:59,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3669250645994832 [2025-04-13 20:55:59,034 INFO L175 Difference]: Start difference. First operand has 71 places, 87 transitions, 760 flow. Second operand 9 states and 142 transitions. [2025-04-13 20:55:59,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 180 transitions, 1754 flow [2025-04-13 20:55:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 180 transitions, 1720 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:59,058 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 1110 flow [2025-04-13 20:55:59,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1110, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2025-04-13 20:55:59,060 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-04-13 20:55:59,060 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 106 transitions, 1110 flow [2025-04-13 20:55:59,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04-13 20:55:59,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:59,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:59,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:55:59,060 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:59,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1795941602, now seen corresponding path program 7 times [2025-04-13 20:55:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:59,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664891791] [2025-04-13 20:55:59,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:55:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:59,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 20:55:59,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:59,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:59,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:59,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:59,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664891791] [2025-04-13 20:55:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664891791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:59,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762741520] [2025-04-13 20:55:59,161 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:55:59,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:59,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:59,163 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-04-13 20:55:59,164 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-04-13 20:55:59,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 20:55:59,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:55:59,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:59,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:59,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:55:59,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:59,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762741520] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:59,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:55:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847613477] [2025-04-13 20:55:59,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:59,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:55:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:59,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:55:59,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:55:59,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:55:59,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 1110 flow. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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-04-13 20:55:59,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:59,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:55:59,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:59,793 INFO L116 PetriNetUnfolderBase]: 3533/5539 cut-off events. [2025-04-13 20:55:59,794 INFO L117 PetriNetUnfolderBase]: For 32545/32610 co-relation queries the response was YES. [2025-04-13 20:55:59,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21797 conditions, 5539 events. 3533/5539 cut-off events. For 32545/32610 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 28294 event pairs, 2139 based on Foata normal form. 67/5241 useless extension candidates. Maximal degree in co-relation 20073. Up to 4501 conditions per place. [2025-04-13 20:55:59,820 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 93 selfloop transitions, 6 changer transitions 35/143 dead transitions. [2025-04-13 20:55:59,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 143 transitions, 1617 flow [2025-04-13 20:55:59,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:55:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:55:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2025-04-13 20:55:59,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.313953488372093 [2025-04-13 20:55:59,822 INFO L175 Difference]: Start difference. First operand has 81 places, 106 transitions, 1110 flow. Second operand 8 states and 108 transitions. [2025-04-13 20:55:59,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 143 transitions, 1617 flow [2025-04-13 20:55:59,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 143 transitions, 1578 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:59,865 INFO L231 Difference]: Finished difference. Result has 90 places, 108 transitions, 1118 flow [2025-04-13 20:55:59,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1118, PETRI_PLACES=90, PETRI_TRANSITIONS=108} [2025-04-13 20:55:59,866 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 53 predicate places. [2025-04-13 20:55:59,866 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 108 transitions, 1118 flow [2025-04-13 20:55:59,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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-04-13 20:55:59,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:59,867 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:59,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:56:00,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:56:00,067 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:00,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 525211984, now seen corresponding path program 8 times [2025-04-13 20:56:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:00,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903243232] [2025-04-13 20:56:00,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:00,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 20:56:00,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:56:00,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:00,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:00,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903243232] [2025-04-13 20:56:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903243232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:00,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:56:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440293366] [2025-04-13 20:56:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:00,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:56:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:56:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:56:00,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:56:00,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 108 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04-13 20:56:00,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:00,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:56:00,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:00,811 INFO L116 PetriNetUnfolderBase]: 4460/6737 cut-off events. [2025-04-13 20:56:00,811 INFO L117 PetriNetUnfolderBase]: For 35467/35467 co-relation queries the response was YES. [2025-04-13 20:56:00,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26791 conditions, 6737 events. 4460/6737 cut-off events. For 35467/35467 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 34510 event pairs, 829 based on Foata normal form. 16/6377 useless extension candidates. Maximal degree in co-relation 26730. Up to 1880 conditions per place. [2025-04-13 20:56:00,843 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 127 selfloop transitions, 90 changer transitions 3/223 dead transitions. [2025-04-13 20:56:00,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 223 transitions, 2293 flow [2025-04-13 20:56:00,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:56:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:56:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2025-04-13 20:56:00,845 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2025-04-13 20:56:00,845 INFO L175 Difference]: Start difference. First operand has 90 places, 108 transitions, 1118 flow. Second operand 10 states and 180 transitions. [2025-04-13 20:56:00,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 223 transitions, 2293 flow [2025-04-13 20:56:00,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 223 transitions, 2267 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-13 20:56:00,916 INFO L231 Difference]: Finished difference. Result has 96 places, 140 transitions, 1807 flow [2025-04-13 20:56:00,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1807, PETRI_PLACES=96, PETRI_TRANSITIONS=140} [2025-04-13 20:56:00,917 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2025-04-13 20:56:00,917 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 140 transitions, 1807 flow [2025-04-13 20:56:00,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04-13 20:56:00,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:00,917 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:00,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:56:00,918 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:00,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1170322492, now seen corresponding path program 9 times [2025-04-13 20:56:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:00,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564713717] [2025-04-13 20:56:00,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:56:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:00,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 20:56:00,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 20:56:00,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:56:00,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:00,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564713717] [2025-04-13 20:56:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564713717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:00,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:56:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930080561] [2025-04-13 20:56:00,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:00,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:56:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:00,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:56:00,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:56:00,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:56:00,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 140 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:56:00,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:00,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:56:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:01,437 INFO L116 PetriNetUnfolderBase]: 4369/6736 cut-off events. [2025-04-13 20:56:01,437 INFO L117 PetriNetUnfolderBase]: For 51944/52004 co-relation queries the response was YES. [2025-04-13 20:56:01,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29083 conditions, 6736 events. 4369/6736 cut-off events. For 51944/52004 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 36003 event pairs, 2412 based on Foata normal form. 84/6405 useless extension candidates. Maximal degree in co-relation 29022. Up to 5177 conditions per place. [2025-04-13 20:56:01,475 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 145 selfloop transitions, 19 changer transitions 2/181 dead transitions. [2025-04-13 20:56:01,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 181 transitions, 2461 flow [2025-04-13 20:56:01,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:56:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:56:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-04-13 20:56:01,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42790697674418604 [2025-04-13 20:56:01,476 INFO L175 Difference]: Start difference. First operand has 96 places, 140 transitions, 1807 flow. Second operand 5 states and 92 transitions. [2025-04-13 20:56:01,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 181 transitions, 2461 flow [2025-04-13 20:56:01,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 181 transitions, 2409 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:01,576 INFO L231 Difference]: Finished difference. Result has 102 places, 150 transitions, 2014 flow [2025-04-13 20:56:01,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2014, PETRI_PLACES=102, PETRI_TRANSITIONS=150} [2025-04-13 20:56:01,577 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2025-04-13 20:56:01,577 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 150 transitions, 2014 flow [2025-04-13 20:56:01,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-04-13 20:56:01,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:01,577 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:01,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:56:01,577 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:01,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1113235780, now seen corresponding path program 10 times [2025-04-13 20:56:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:01,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063223619] [2025-04-13 20:56:01,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:56:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:01,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 20:56:01,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-04-13 20:56:01,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:56:01,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:01,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063223619] [2025-04-13 20:56:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063223619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:01,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381062587] [2025-04-13 20:56:01,613 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:56:01,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:01,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:01,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:01,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:56:01,667 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 20:56:01,681 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-04-13 20:56:01,681 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:56:01,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:01,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:56:01,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:01,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381062587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:01,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-13 20:56:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666316812] [2025-04-13 20:56:01,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:01,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:56:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:01,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:56:01,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:56:01,751 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:56:01,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 150 transitions, 2014 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-04-13 20:56:01,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:01,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:56:01,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:02,243 INFO L116 PetriNetUnfolderBase]: 3861/5976 cut-off events. [2025-04-13 20:56:02,243 INFO L117 PetriNetUnfolderBase]: For 49874/49966 co-relation queries the response was YES. [2025-04-13 20:56:02,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24708 conditions, 5976 events. 3861/5976 cut-off events. For 49874/49966 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 31146 event pairs, 879 based on Foata normal form. 358/5977 useless extension candidates. Maximal degree in co-relation 24644. Up to 2008 conditions per place. [2025-04-13 20:56:02,274 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 103 selfloop transitions, 62 changer transitions 0/179 dead transitions. [2025-04-13 20:56:02,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 179 transitions, 2203 flow [2025-04-13 20:56:02,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:56:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:56:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-04-13 20:56:02,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4152823920265781 [2025-04-13 20:56:02,275 INFO L175 Difference]: Start difference. First operand has 102 places, 150 transitions, 2014 flow. Second operand 7 states and 125 transitions. [2025-04-13 20:56:02,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 179 transitions, 2203 flow [2025-04-13 20:56:02,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 179 transitions, 2087 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-04-13 20:56:02,329 INFO L231 Difference]: Finished difference. Result has 98 places, 132 transitions, 1712 flow [2025-04-13 20:56:02,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1712, PETRI_PLACES=98, PETRI_TRANSITIONS=132} [2025-04-13 20:56:02,329 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2025-04-13 20:56:02,329 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 132 transitions, 1712 flow [2025-04-13 20:56:02,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-04-13 20:56:02,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:02,330 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:02,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:56:02,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:02,530 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:02,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1042768289, now seen corresponding path program 1 times [2025-04-13 20:56:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:02,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745609360] [2025-04-13 20:56:02,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:56:02,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:56:02,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:56:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:02,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745609360] [2025-04-13 20:56:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745609360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:02,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468593231] [2025-04-13 20:56:02,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:02,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:02,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:02,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:56:02,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:56:02,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:56:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:02,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:56:02,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:56:02,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:56:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468593231] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:02,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:56:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-04-13 20:56:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140622526] [2025-04-13 20:56:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:02,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:56:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:02,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:56:02,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:56:02,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 43 [2025-04-13 20:56:02,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 132 transitions, 1712 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04-13 20:56:02,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:02,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 43 [2025-04-13 20:56:02,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:03,227 INFO L116 PetriNetUnfolderBase]: 4244/6674 cut-off events. [2025-04-13 20:56:03,227 INFO L117 PetriNetUnfolderBase]: For 48731/48811 co-relation queries the response was YES. [2025-04-13 20:56:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27023 conditions, 6674 events. 4244/6674 cut-off events. For 48731/48811 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 36005 event pairs, 1922 based on Foata normal form. 58/6311 useless extension candidates. Maximal degree in co-relation 26963. Up to 4238 conditions per place. [2025-04-13 20:56:03,258 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 164 selfloop transitions, 8 changer transitions 0/186 dead transitions. [2025-04-13 20:56:03,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 186 transitions, 2843 flow [2025-04-13 20:56:03,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:56:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:56:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-13 20:56:03,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31007751937984496 [2025-04-13 20:56:03,259 INFO L175 Difference]: Start difference. First operand has 98 places, 132 transitions, 1712 flow. Second operand 6 states and 80 transitions. [2025-04-13 20:56:03,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 186 transitions, 2843 flow [2025-04-13 20:56:03,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 186 transitions, 2540 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-04-13 20:56:03,303 INFO L231 Difference]: Finished difference. Result has 96 places, 133 transitions, 1534 flow [2025-04-13 20:56:03,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1534, PETRI_PLACES=96, PETRI_TRANSITIONS=133} [2025-04-13 20:56:03,303 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2025-04-13 20:56:03,303 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 133 transitions, 1534 flow [2025-04-13 20:56:03,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04-13 20:56:03,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:03,303 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:03,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:56:03,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:56:03,504 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:03,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -160833684, now seen corresponding path program 1 times [2025-04-13 20:56:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:03,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968650967] [2025-04-13 20:56:03,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:03,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:56:03,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:56:03,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:03,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:56:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:03,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968650967] [2025-04-13 20:56:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968650967] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:03,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400766924] [2025-04-13 20:56:03,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:03,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:03,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:03,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:56:03,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:56:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:56:03,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:03,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:56:03,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:56:03,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:56:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400766924] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:03,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14 [2025-04-13 20:56:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917843564] [2025-04-13 20:56:03,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:03,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:56:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:03,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:56:03,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:56:03,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:56:03,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 133 transitions, 1534 flow. Second operand has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 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-04-13 20:56:03,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:03,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:56:03,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:04,895 INFO L116 PetriNetUnfolderBase]: 8275/12895 cut-off events. [2025-04-13 20:56:04,895 INFO L117 PetriNetUnfolderBase]: For 73125/73141 co-relation queries the response was YES. [2025-04-13 20:56:04,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52402 conditions, 12895 events. 8275/12895 cut-off events. For 73125/73141 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 73396 event pairs, 1459 based on Foata normal form. 380/12749 useless extension candidates. Maximal degree in co-relation 49671. Up to 5860 conditions per place. [2025-04-13 20:56:04,941 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 196 selfloop transitions, 30 changer transitions 179/408 dead transitions. [2025-04-13 20:56:04,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 408 transitions, 5163 flow [2025-04-13 20:56:04,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:56:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:56:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 254 transitions. [2025-04-13 20:56:04,942 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3281653746770026 [2025-04-13 20:56:04,942 INFO L175 Difference]: Start difference. First operand has 96 places, 133 transitions, 1534 flow. Second operand 18 states and 254 transitions. [2025-04-13 20:56:04,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 408 transitions, 5163 flow [2025-04-13 20:56:05,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 408 transitions, 5144 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:56:05,034 INFO L231 Difference]: Finished difference. Result has 120 places, 151 transitions, 1898 flow [2025-04-13 20:56:05,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1898, PETRI_PLACES=120, PETRI_TRANSITIONS=151} [2025-04-13 20:56:05,034 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 83 predicate places. [2025-04-13 20:56:05,035 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 151 transitions, 1898 flow [2025-04-13 20:56:05,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 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-04-13 20:56:05,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:05,035 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:05,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:56:05,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:05,235 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:05,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1318628968, now seen corresponding path program 2 times [2025-04-13 20:56:05,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:05,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822522220] [2025-04-13 20:56:05,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:05,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 20:56:05,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 20:56:05,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 20:56:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:05,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822522220] [2025-04-13 20:56:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822522220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:05,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276147129] [2025-04-13 20:56:05,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:05,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:05,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:05,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:56:05,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 20:56:05,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 20:56:05,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:05,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:05,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:56:05,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 20:56:05,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 20:56:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276147129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:05,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:05,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 20:56:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393954430] [2025-04-13 20:56:05,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:05,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:56:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:05,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:56:05,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:56:05,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2025-04-13 20:56:05,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 151 transitions, 1898 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-04-13 20:56:05,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:05,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2025-04-13 20:56:05,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:06,057 INFO L116 PetriNetUnfolderBase]: 5159/7986 cut-off events. [2025-04-13 20:56:06,057 INFO L117 PetriNetUnfolderBase]: For 52932/52962 co-relation queries the response was YES. [2025-04-13 20:56:06,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34768 conditions, 7986 events. 5159/7986 cut-off events. For 52932/52962 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 43002 event pairs, 596 based on Foata normal form. 4/7793 useless extension candidates. Maximal degree in co-relation 34690. Up to 4240 conditions per place. [2025-04-13 20:56:06,082 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 0 selfloop transitions, 0 changer transitions 201/201 dead transitions. [2025-04-13 20:56:06,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 201 transitions, 2617 flow [2025-04-13 20:56:06,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:56:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:56:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2025-04-13 20:56:06,084 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2025-04-13 20:56:06,084 INFO L175 Difference]: Start difference. First operand has 120 places, 151 transitions, 1898 flow. Second operand 7 states and 111 transitions. [2025-04-13 20:56:06,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 201 transitions, 2617 flow [2025-04-13 20:56:06,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 2495 flow, removed 52 selfloop flow, removed 8 redundant places. [2025-04-13 20:56:06,160 INFO L231 Difference]: Finished difference. Result has 107 places, 0 transitions, 0 flow [2025-04-13 20:56:06,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=107, PETRI_TRANSITIONS=0} [2025-04-13 20:56:06,160 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2025-04-13 20:56:06,160 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 0 transitions, 0 flow [2025-04-13 20:56:06,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-04-13 20:56:06,162 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:56:06,162 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:56:06,162 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:56:06,162 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:56:06,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:56:06,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:06,363 INFO L422 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 1, 1, 1] [2025-04-13 20:56:06,365 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:56:06,365 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:56:06,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:56:06 BasicIcfg [2025-04-13 20:56:06,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:56:06,369 INFO L158 Benchmark]: Toolchain (without parser) took 14131.77ms. Allocated memory was 125.8MB in the beginning and 625.0MB in the end (delta: 499.1MB). Free memory was 85.8MB in the beginning and 147.9MB in the end (delta: -62.1MB). Peak memory consumption was 435.9MB. Max. memory is 8.0GB. [2025-04-13 20:56:06,369 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:56:06,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.48ms. Allocated memory is still 125.8MB. Free memory was 85.8MB in the beginning and 70.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:56:06,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.56ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 68.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:56:06,370 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 66.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:56:06,370 INFO L158 Benchmark]: RCFGBuilder took 496.04ms. Allocated memory is still 125.8MB. Free memory was 66.8MB in the beginning and 82.4MB in the end (delta: -15.6MB). Peak memory consumption was 56.8MB. Max. memory is 8.0GB. [2025-04-13 20:56:06,370 INFO L158 Benchmark]: TraceAbstraction took 13308.11ms. Allocated memory was 125.8MB in the beginning and 625.0MB in the end (delta: 499.1MB). Free memory was 81.8MB in the beginning and 147.9MB in the end (delta: -66.2MB). Peak memory consumption was 433.7MB. Max. memory is 8.0GB. [2025-04-13 20:56:06,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.48ms. Allocated memory is still 125.8MB. Free memory was 85.8MB in the beginning and 70.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.56ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 68.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 66.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 496.04ms. Allocated memory is still 125.8MB. Free memory was 66.8MB in the beginning and 82.4MB in the end (delta: -15.6MB). Peak memory consumption was 56.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13308.11ms. Allocated memory was 125.8MB in the beginning and 625.0MB in the end (delta: 499.1MB). Free memory was 81.8MB in the beginning and 147.9MB in the end (delta: -66.2MB). Peak memory consumption was 433.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 52 locations, 73 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.2s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 865 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3341 IncrementalHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 3 mSDtfsCounter, 3341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 458 SyntacticMatches, 18 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2014occurred in iteration=16, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 838 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1031 ConstructedInterpolants, 0 QuantifiedInterpolants, 2770 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1387 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 32 InterpolantComputations, 15 PerfectInterpolantSequences, 192/229 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:56:06,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...