/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/chl-nzb-file-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:03:22,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:03:22,349 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:03:22,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:03:22,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:03:22,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:03:22,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:03:22,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:03:22,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:03:22,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:03:22,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:03:22,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:03:22,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:03:22,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:03:22,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:03:22,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:03:22,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:03:22,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:03:22,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:03:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:03:22,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:03:22,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:03:22,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:03:22,377 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:03:22,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:03:22,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:03:22,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:03:22,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:03:22,610 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:03:22,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2025-04-13 20:03:23,944 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d86f1acd/c5628e00ff944ea3bc0554975ba569b9/FLAGeb45af0c2 [2025-04-13 20:03:24,179 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:03:24,180 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2025-04-13 20:03:24,192 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d86f1acd/c5628e00ff944ea3bc0554975ba569b9/FLAGeb45af0c2 [2025-04-13 20:03:24,994 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d86f1acd/c5628e00ff944ea3bc0554975ba569b9 [2025-04-13 20:03:24,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:03:24,998 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:03:24,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:03:24,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:03:25,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:03:25,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:03:24" (1/1) ... [2025-04-13 20:03:25,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c05143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25, skipping insertion in model container [2025-04-13 20:03:25,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:03:24" (1/1) ... [2025-04-13 20:03:25,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:03:25,226 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-04-13 20:03:25,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:03:25,249 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:03:25,309 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-04-13 20:03:25,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:03:25,324 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:03:25,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25 WrapperNode [2025-04-13 20:03:25,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:03:25,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:03:25,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:03:25,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:03:25,331 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:03:25" (1/1) ... [2025-04-13 20:03:25,345 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:03:25" (1/1) ... [2025-04-13 20:03:25,391 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-04-13 20:03:25,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:03:25,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:03:25,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:03:25,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:03:25,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,430 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 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:03:25,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:03:25,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:03:25,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:03:25,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:03:25,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (1/1) ... [2025-04-13 20:03:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:03:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:25,498 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:03:25,504 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:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:03:25,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:03:25,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:03:25,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:03:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:03:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:03:25,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:03:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:03:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:03:25,520 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:03:25,631 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:03:25,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:03:26,251 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:03:26,252 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:03:26,252 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:03:27,072 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 20:03:27,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:03:27 BoogieIcfgContainer [2025-04-13 20:03:27,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:03:27,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:03:27,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:03:27,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:03:27,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:03:24" (1/3) ... [2025-04-13 20:03:27,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665b391d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:03:27, skipping insertion in model container [2025-04-13 20:03:27,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:25" (2/3) ... [2025-04-13 20:03:27,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665b391d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:03:27, skipping insertion in model container [2025-04-13 20:03:27,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:03:27" (3/3) ... [2025-04-13 20:03:27,080 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-04-13 20:03:27,091 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:03:27,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:03:27,092 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:03:27,192 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:03:27,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 87 flow [2025-04-13 20:03:27,242 INFO L116 PetriNetUnfolderBase]: 9/30 cut-off events. [2025-04-13 20:03:27,245 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:03:27,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 9/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-13 20:03:27,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 87 flow [2025-04-13 20:03:27,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 76 flow [2025-04-13 20:03:27,256 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:03:27,265 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;@15998385, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:03:27,265 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:03:27,283 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:03:27,283 INFO L116 PetriNetUnfolderBase]: 9/28 cut-off events. [2025-04-13 20:03:27,283 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:03:27,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:27,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:27,284 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:03:27,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1035879962, now seen corresponding path program 1 times [2025-04-13 20:03:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:27,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376479374] [2025-04-13 20:03:27,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:27,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:03:27,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:03:27,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:27,642 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:03:27,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:27,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376479374] [2025-04-13 20:03:27,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376479374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:27,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:27,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:03:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531250652] [2025-04-13 20:03:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:27,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:03:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:03:27,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:03:27,674 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:27,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03:27,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:27,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:27,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:27,943 INFO L116 PetriNetUnfolderBase]: 277/376 cut-off events. [2025-04-13 20:03:27,944 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-13 20:03:27,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 376 events. 277/376 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 808 event pairs, 124 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 670. Up to 374 conditions per place. [2025-04-13 20:03:27,948 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-04-13 20:03:27,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 146 flow [2025-04-13 20:03:27,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:03:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:03:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-13 20:03:27,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-13 20:03:27,958 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 76 flow. Second operand 3 states and 44 transitions. [2025-04-13 20:03:27,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 146 flow [2025-04-13 20:03:27,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:03:27,962 INFO L231 Difference]: Finished difference. Result has 27 places, 32 transitions, 96 flow [2025-04-13 20:03:27,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=27, PETRI_TRANSITIONS=32} [2025-04-13 20:03:27,965 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-13 20:03:27,965 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 32 transitions, 96 flow [2025-04-13 20:03:27,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03:27,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:27,966 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] [2025-04-13 20:03:27,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:03:27,966 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:03:27,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1552207684, now seen corresponding path program 1 times [2025-04-13 20:03:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:27,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295811451] [2025-04-13 20:03:27,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:27,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:27,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:03:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:03:28,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:28,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:28,203 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:03:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:28,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295811451] [2025-04-13 20:03:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295811451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:28,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259844628] [2025-04-13 20:03:28,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:28,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:28,207 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:03:28,208 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:03:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:03:28,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:03:28,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:28,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:28,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:03:28,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:28,498 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:03:28,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:28,521 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:03:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259844628] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:03:28,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:03:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 20:03:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704527360] [2025-04-13 20:03:28,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:03:28,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:03:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:28,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:03:28,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:03:28,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:28,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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:03:28,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:28,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:28,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:28,735 INFO L116 PetriNetUnfolderBase]: 277/385 cut-off events. [2025-04-13 20:03:28,736 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 20:03:28,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 385 events. 277/385 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 808 event pairs, 124 based on Foata normal form. 6/240 useless extension candidates. Maximal degree in co-relation 760. Up to 374 conditions per place. [2025-04-13 20:03:28,738 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 26 selfloop transitions, 15 changer transitions 0/41 dead transitions. [2025-04-13 20:03:28,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 214 flow [2025-04-13 20:03:28,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:03:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:03:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 20:03:28,741 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-04-13 20:03:28,741 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 96 flow. Second operand 6 states and 68 transitions. [2025-04-13 20:03:28,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 214 flow [2025-04-13 20:03:28,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:28,742 INFO L231 Difference]: Finished difference. Result has 34 places, 41 transitions, 186 flow [2025-04-13 20:03:28,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=34, PETRI_TRANSITIONS=41} [2025-04-13 20:03:28,744 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2025-04-13 20:03:28,744 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 41 transitions, 186 flow [2025-04-13 20:03:28,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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:03:28,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:28,744 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:28,751 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:03:28,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:28,945 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:03:28,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1815413410, now seen corresponding path program 2 times [2025-04-13 20:03:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:28,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246592729] [2025-04-13 20:03:28,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:03:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:28,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 20:03:29,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-13 20:03:29,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:03:29,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:03:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:29,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246592729] [2025-04-13 20:03:29,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246592729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:29,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:29,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182443317] [2025-04-13 20:03:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:29,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:29,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:29,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:29,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:29,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:29,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 41 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:29,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:29,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:29,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:29,863 INFO L116 PetriNetUnfolderBase]: 445/644 cut-off events. [2025-04-13 20:03:29,864 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 20:03:29,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 644 events. 445/644 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1948 event pairs, 124 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 1275. Up to 360 conditions per place. [2025-04-13 20:03:29,868 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 69 selfloop transitions, 13 changer transitions 1/83 dead transitions. [2025-04-13 20:03:29,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 448 flow [2025-04-13 20:03:29,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-13 20:03:29,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-04-13 20:03:29,871 INFO L175 Difference]: Start difference. First operand has 34 places, 41 transitions, 186 flow. Second operand 5 states and 87 transitions. [2025-04-13 20:03:29,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 448 flow [2025-04-13 20:03:29,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 83 transitions, 424 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:29,873 INFO L231 Difference]: Finished difference. Result has 40 places, 53 transitions, 261 flow [2025-04-13 20:03:29,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=40, PETRI_TRANSITIONS=53} [2025-04-13 20:03:29,876 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-13 20:03:29,876 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 53 transitions, 261 flow [2025-04-13 20:03:29,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:29,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:29,876 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:29,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:03:29,878 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:03:29,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 972182612, now seen corresponding path program 3 times [2025-04-13 20:03:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:29,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473929996] [2025-04-13 20:03:29,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:29,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 20:03:29,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-13 20:03:29,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:03:29,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:03:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:30,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473929996] [2025-04-13 20:03:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473929996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265732938] [2025-04-13 20:03:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:30,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:30,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:30,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:30,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 53 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:30,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:30,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:30,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:30,933 INFO L116 PetriNetUnfolderBase]: 976/1403 cut-off events. [2025-04-13 20:03:30,933 INFO L117 PetriNetUnfolderBase]: For 849/849 co-relation queries the response was YES. [2025-04-13 20:03:30,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4196 conditions, 1403 events. 976/1403 cut-off events. For 849/849 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5430 event pairs, 74 based on Foata normal form. 1/1042 useless extension candidates. Maximal degree in co-relation 4116. Up to 557 conditions per place. [2025-04-13 20:03:30,943 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 81 selfloop transitions, 43 changer transitions 1/125 dead transitions. [2025-04-13 20:03:30,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 125 transitions, 789 flow [2025-04-13 20:03:30,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:03:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:03:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-13 20:03:30,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2025-04-13 20:03:30,945 INFO L175 Difference]: Start difference. First operand has 40 places, 53 transitions, 261 flow. Second operand 6 states and 115 transitions. [2025-04-13 20:03:30,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 125 transitions, 789 flow [2025-04-13 20:03:30,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 125 transitions, 789 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:03:30,948 INFO L231 Difference]: Finished difference. Result has 50 places, 88 transitions, 638 flow [2025-04-13 20:03:30,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=50, PETRI_TRANSITIONS=88} [2025-04-13 20:03:30,949 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-04-13 20:03:30,949 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 88 transitions, 638 flow [2025-04-13 20:03:30,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:30,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:30,949 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:30,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:03:30,949 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:03:30,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1325262702, now seen corresponding path program 4 times [2025-04-13 20:03:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:30,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783809715] [2025-04-13 20:03:30,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:03:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:30,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 20:03:30,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:03:30,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:03:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:03:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:31,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783809715] [2025-04-13 20:03:31,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783809715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:31,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408309156] [2025-04-13 20:03:31,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:03:31,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:31,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:31,138 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:03:31,139 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:03:31,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 20:03:31,325 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:03:31,325 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:03:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:31,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:03:31,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:03:31,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:03:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408309156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:03:31,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:03:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 20:03:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332345790] [2025-04-13 20:03:31,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:03:31,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:03:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:31,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:03:31,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:03:31,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:31,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 88 transitions, 638 flow. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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:03:31,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:31,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:31,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:31,762 INFO L116 PetriNetUnfolderBase]: 976/1406 cut-off events. [2025-04-13 20:03:31,762 INFO L117 PetriNetUnfolderBase]: For 2950/2950 co-relation queries the response was YES. [2025-04-13 20:03:31,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5785 conditions, 1406 events. 976/1406 cut-off events. For 2950/2950 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5249 event pairs, 312 based on Foata normal form. 1/1054 useless extension candidates. Maximal degree in co-relation 5688. Up to 1392 conditions per place. [2025-04-13 20:03:31,770 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 73 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2025-04-13 20:03:31,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 838 flow [2025-04-13 20:03:31,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:03:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:03:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2025-04-13 20:03:31,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2943722943722944 [2025-04-13 20:03:31,772 INFO L175 Difference]: Start difference. First operand has 50 places, 88 transitions, 638 flow. Second operand 7 states and 68 transitions. [2025-04-13 20:03:31,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 838 flow [2025-04-13 20:03:31,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 818 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 20:03:31,782 INFO L231 Difference]: Finished difference. Result has 57 places, 91 transitions, 686 flow [2025-04-13 20:03:31,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=686, PETRI_PLACES=57, PETRI_TRANSITIONS=91} [2025-04-13 20:03:31,785 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-04-13 20:03:31,785 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 91 transitions, 686 flow [2025-04-13 20:03:31,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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:03:31,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:31,785 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:31,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:03:31,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:31,986 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:03:31,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2088739886, now seen corresponding path program 5 times [2025-04-13 20:03:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:31,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794025918] [2025-04-13 20:03:31,987 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:03:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:32,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-13 20:03:32,040 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:03:32,040 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:03:32,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:32,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794025918] [2025-04-13 20:03:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794025918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952088204] [2025-04-13 20:03:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:32,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:32,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:32,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:32,594 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:32,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 91 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:32,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:32,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:32,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:33,151 INFO L116 PetriNetUnfolderBase]: 1157/1698 cut-off events. [2025-04-13 20:03:33,151 INFO L117 PetriNetUnfolderBase]: For 2712/2712 co-relation queries the response was YES. [2025-04-13 20:03:33,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6742 conditions, 1698 events. 1157/1698 cut-off events. For 2712/2712 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7043 event pairs, 147 based on Foata normal form. 1/1254 useless extension candidates. Maximal degree in co-relation 6624. Up to 772 conditions per place. [2025-04-13 20:03:33,158 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 98 selfloop transitions, 53 changer transitions 1/152 dead transitions. [2025-04-13 20:03:33,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 152 transitions, 1359 flow [2025-04-13 20:03:33,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-04-13 20:03:33,160 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-04-13 20:03:33,160 INFO L175 Difference]: Start difference. First operand has 57 places, 91 transitions, 686 flow. Second operand 5 states and 95 transitions. [2025-04-13 20:03:33,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 152 transitions, 1359 flow [2025-04-13 20:03:33,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 152 transitions, 1323 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 20:03:33,168 INFO L231 Difference]: Finished difference. Result has 61 places, 123 transitions, 1174 flow [2025-04-13 20:03:33,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1174, PETRI_PLACES=61, PETRI_TRANSITIONS=123} [2025-04-13 20:03:33,169 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2025-04-13 20:03:33,169 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 123 transitions, 1174 flow [2025-04-13 20:03:33,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:33,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:33,169 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:33,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:03:33,169 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:03:33,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash 778199618, now seen corresponding path program 6 times [2025-04-13 20:03:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:33,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674687805] [2025-04-13 20:03:33,170 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:03:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:33,186 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-04-13 20:03:33,200 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-13 20:03:33,201 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:03:33,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:33,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:33,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674687805] [2025-04-13 20:03:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674687805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932798291] [2025-04-13 20:03:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:33,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:33,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:33,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:33,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:33,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 123 transitions, 1174 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:33,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:33,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:33,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:34,023 INFO L116 PetriNetUnfolderBase]: 1197/1760 cut-off events. [2025-04-13 20:03:34,023 INFO L117 PetriNetUnfolderBase]: For 5155/5155 co-relation queries the response was YES. [2025-04-13 20:03:34,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8460 conditions, 1760 events. 1197/1760 cut-off events. For 5155/5155 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7318 event pairs, 160 based on Foata normal form. 1/1300 useless extension candidates. Maximal degree in co-relation 8356. Up to 867 conditions per place. [2025-04-13 20:03:34,033 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 100 selfloop transitions, 56 changer transitions 1/157 dead transitions. [2025-04-13 20:03:34,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 157 transitions, 1716 flow [2025-04-13 20:03:34,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-13 20:03:34,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-04-13 20:03:34,034 INFO L175 Difference]: Start difference. First operand has 61 places, 123 transitions, 1174 flow. Second operand 5 states and 87 transitions. [2025-04-13 20:03:34,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 157 transitions, 1716 flow [2025-04-13 20:03:34,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 157 transitions, 1704 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 20:03:34,046 INFO L231 Difference]: Finished difference. Result has 68 places, 135 transitions, 1499 flow [2025-04-13 20:03:34,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1499, PETRI_PLACES=68, PETRI_TRANSITIONS=135} [2025-04-13 20:03:34,047 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-04-13 20:03:34,047 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 135 transitions, 1499 flow [2025-04-13 20:03:34,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:34,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:34,047 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:34,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:03:34,047 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:03:34,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -304011302, now seen corresponding path program 7 times [2025-04-13 20:03:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:34,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220969340] [2025-04-13 20:03:34,048 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:03:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:34,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:03:34,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:03:34,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:34,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:34,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220969340] [2025-04-13 20:03:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220969340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:34,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215194936] [2025-04-13 20:03:34,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:34,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:34,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:34,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:34,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:34,610 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:34,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 135 transitions, 1499 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:34,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:34,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:34,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:35,299 INFO L116 PetriNetUnfolderBase]: 1755/2547 cut-off events. [2025-04-13 20:03:35,300 INFO L117 PetriNetUnfolderBase]: For 8737/8737 co-relation queries the response was YES. [2025-04-13 20:03:35,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12725 conditions, 2547 events. 1755/2547 cut-off events. For 8737/8737 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11270 event pairs, 200 based on Foata normal form. 1/1821 useless extension candidates. Maximal degree in co-relation 12617. Up to 1242 conditions per place. [2025-04-13 20:03:35,314 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 191 selfloop transitions, 31 changer transitions 5/227 dead transitions. [2025-04-13 20:03:35,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 227 transitions, 2847 flow [2025-04-13 20:03:35,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-13 20:03:35,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-04-13 20:03:35,316 INFO L175 Difference]: Start difference. First operand has 68 places, 135 transitions, 1499 flow. Second operand 5 states and 85 transitions. [2025-04-13 20:03:35,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 227 transitions, 2847 flow [2025-04-13 20:03:35,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 227 transitions, 2770 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:35,334 INFO L231 Difference]: Finished difference. Result has 75 places, 162 transitions, 1860 flow [2025-04-13 20:03:35,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1860, PETRI_PLACES=75, PETRI_TRANSITIONS=162} [2025-04-13 20:03:35,336 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2025-04-13 20:03:35,336 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 162 transitions, 1860 flow [2025-04-13 20:03:35,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:35,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:35,337 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:35,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:03:35,337 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:03:35,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 767913234, now seen corresponding path program 8 times [2025-04-13 20:03:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:35,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403213022] [2025-04-13 20:03:35,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:03:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:35,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:03:35,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-13 20:03:35,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:03:35,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:35,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:35,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403213022] [2025-04-13 20:03:35,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403213022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:35,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:35,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250251790] [2025-04-13 20:03:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:35,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:35,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:35,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:35,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:35,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:35,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 162 transitions, 1860 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:35,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:35,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:35,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:36,412 INFO L116 PetriNetUnfolderBase]: 2022/2921 cut-off events. [2025-04-13 20:03:36,412 INFO L117 PetriNetUnfolderBase]: For 11742/11742 co-relation queries the response was YES. [2025-04-13 20:03:36,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15548 conditions, 2921 events. 2022/2921 cut-off events. For 11742/11742 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 13393 event pairs, 130 based on Foata normal form. 1/2066 useless extension candidates. Maximal degree in co-relation 15437. Up to 1223 conditions per place. [2025-04-13 20:03:36,432 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 167 selfloop transitions, 93 changer transitions 3/263 dead transitions. [2025-04-13 20:03:36,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 263 transitions, 3272 flow [2025-04-13 20:03:36,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:03:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:03:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-13 20:03:36,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.601010101010101 [2025-04-13 20:03:36,433 INFO L175 Difference]: Start difference. First operand has 75 places, 162 transitions, 1860 flow. Second operand 6 states and 119 transitions. [2025-04-13 20:03:36,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 263 transitions, 3272 flow [2025-04-13 20:03:36,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 263 transitions, 3237 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-13 20:03:36,464 INFO L231 Difference]: Finished difference. Result has 83 places, 203 transitions, 2678 flow [2025-04-13 20:03:36,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2678, PETRI_PLACES=83, PETRI_TRANSITIONS=203} [2025-04-13 20:03:36,465 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-04-13 20:03:36,465 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 203 transitions, 2678 flow [2025-04-13 20:03:36,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:36,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:36,465 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:36,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:03:36,465 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:03:36,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1743615528, now seen corresponding path program 1 times [2025-04-13 20:03:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:36,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533019590] [2025-04-13 20:03:36,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:36,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 20:03:36,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:03:36,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:36,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:36,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533019590] [2025-04-13 20:03:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533019590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:36,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:36,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:36,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340043669] [2025-04-13 20:03:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:36,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:36,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:36,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:36,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:36,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 203 transitions, 2678 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:36,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:36,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:36,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:37,484 INFO L116 PetriNetUnfolderBase]: 2080/3017 cut-off events. [2025-04-13 20:03:37,484 INFO L117 PetriNetUnfolderBase]: For 16773/16773 co-relation queries the response was YES. [2025-04-13 20:03:37,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17961 conditions, 3017 events. 2080/3017 cut-off events. For 16773/16773 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 13750 event pairs, 394 based on Foata normal form. 11/2136 useless extension candidates. Maximal degree in co-relation 17847. Up to 2061 conditions per place. [2025-04-13 20:03:37,499 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 228 selfloop transitions, 19 changer transitions 13/260 dead transitions. [2025-04-13 20:03:37,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 260 transitions, 3696 flow [2025-04-13 20:03:37,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-13 20:03:37,500 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-13 20:03:37,500 INFO L175 Difference]: Start difference. First operand has 83 places, 203 transitions, 2678 flow. Second operand 5 states and 81 transitions. [2025-04-13 20:03:37,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 260 transitions, 3696 flow [2025-04-13 20:03:37,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 260 transitions, 3626 flow, removed 29 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:37,539 INFO L231 Difference]: Finished difference. Result has 89 places, 198 transitions, 2605 flow [2025-04-13 20:03:37,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2605, PETRI_PLACES=89, PETRI_TRANSITIONS=198} [2025-04-13 20:03:37,539 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2025-04-13 20:03:37,539 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 198 transitions, 2605 flow [2025-04-13 20:03:37,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:37,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:37,539 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:37,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:03:37,540 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:03:37,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash -824101474, now seen corresponding path program 1 times [2025-04-13 20:03:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:37,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102365364] [2025-04-13 20:03:37,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:37,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 20:03:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:03:37,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:37,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:37,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102365364] [2025-04-13 20:03:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102365364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456764176] [2025-04-13 20:03:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:37,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:37,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:37,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:37,685 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:37,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 198 transitions, 2605 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:37,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:37,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:37,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:38,440 INFO L116 PetriNetUnfolderBase]: 2237/3280 cut-off events. [2025-04-13 20:03:38,440 INFO L117 PetriNetUnfolderBase]: For 16501/16501 co-relation queries the response was YES. [2025-04-13 20:03:38,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19085 conditions, 3280 events. 2237/3280 cut-off events. For 16501/16501 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 15660 event pairs, 180 based on Foata normal form. 5/2294 useless extension candidates. Maximal degree in co-relation 18968. Up to 1394 conditions per place. [2025-04-13 20:03:38,455 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 203 selfloop transitions, 62 changer transitions 40/305 dead transitions. [2025-04-13 20:03:38,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 305 transitions, 4240 flow [2025-04-13 20:03:38,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:03:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:03:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-13 20:03:38,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2025-04-13 20:03:38,457 INFO L175 Difference]: Start difference. First operand has 89 places, 198 transitions, 2605 flow. Second operand 6 states and 115 transitions. [2025-04-13 20:03:38,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 305 transitions, 4240 flow [2025-04-13 20:03:38,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 305 transitions, 4029 flow, removed 95 selfloop flow, removed 3 redundant places. [2025-04-13 20:03:38,499 INFO L231 Difference]: Finished difference. Result has 94 places, 195 transitions, 2561 flow [2025-04-13 20:03:38,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2561, PETRI_PLACES=94, PETRI_TRANSITIONS=195} [2025-04-13 20:03:38,500 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2025-04-13 20:03:38,500 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 195 transitions, 2561 flow [2025-04-13 20:03:38,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:38,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:38,500 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:38,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:03:38,500 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:03:38,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1295810994, now seen corresponding path program 2 times [2025-04-13 20:03:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:38,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433729873] [2025-04-13 20:03:38,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:03:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:38,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:03:38,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 20:03:38,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:03:38,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:38,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433729873] [2025-04-13 20:03:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433729873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353375389] [2025-04-13 20:03:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:38,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:38,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:38,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:38,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:38,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 195 transitions, 2561 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:38,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:38,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:38,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:39,328 INFO L116 PetriNetUnfolderBase]: 2153/3204 cut-off events. [2025-04-13 20:03:39,328 INFO L117 PetriNetUnfolderBase]: For 18958/18958 co-relation queries the response was YES. [2025-04-13 20:03:39,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18416 conditions, 3204 events. 2153/3204 cut-off events. For 18958/18958 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 15599 event pairs, 329 based on Foata normal form. 7/2238 useless extension candidates. Maximal degree in co-relation 18297. Up to 1616 conditions per place. [2025-04-13 20:03:39,344 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 192 selfloop transitions, 52 changer transitions 48/292 dead transitions. [2025-04-13 20:03:39,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 292 transitions, 4007 flow [2025-04-13 20:03:39,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:03:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:03:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2025-04-13 20:03:39,372 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5021645021645021 [2025-04-13 20:03:39,372 INFO L175 Difference]: Start difference. First operand has 94 places, 195 transitions, 2561 flow. Second operand 7 states and 116 transitions. [2025-04-13 20:03:39,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 292 transitions, 4007 flow [2025-04-13 20:03:39,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 292 transitions, 3825 flow, removed 46 selfloop flow, removed 4 redundant places. [2025-04-13 20:03:39,423 INFO L231 Difference]: Finished difference. Result has 100 places, 196 transitions, 2590 flow [2025-04-13 20:03:39,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2427, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2590, PETRI_PLACES=100, PETRI_TRANSITIONS=196} [2025-04-13 20:03:39,424 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2025-04-13 20:03:39,424 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 196 transitions, 2590 flow [2025-04-13 20:03:39,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:39,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:39,424 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:39,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:03:39,424 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:03:39,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash -861385220, now seen corresponding path program 1 times [2025-04-13 20:03:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:39,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417797103] [2025-04-13 20:03:39,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:39,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 20:03:39,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:03:39,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:39,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:39,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:39,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417797103] [2025-04-13 20:03:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417797103] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:39,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255947204] [2025-04-13 20:03:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:39,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:39,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:39,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:39,572 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:39,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 196 transitions, 2590 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:39,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:39,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:39,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:40,301 INFO L116 PetriNetUnfolderBase]: 2131/3155 cut-off events. [2025-04-13 20:03:40,301 INFO L117 PetriNetUnfolderBase]: For 17519/17519 co-relation queries the response was YES. [2025-04-13 20:03:40,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18263 conditions, 3155 events. 2131/3155 cut-off events. For 17519/17519 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 15091 event pairs, 142 based on Foata normal form. 6/2194 useless extension candidates. Maximal degree in co-relation 18143. Up to 1463 conditions per place. [2025-04-13 20:03:40,313 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 211 selfloop transitions, 49 changer transitions 41/301 dead transitions. [2025-04-13 20:03:40,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 301 transitions, 4296 flow [2025-04-13 20:03:40,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:03:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:03:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-04-13 20:03:40,314 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5505050505050505 [2025-04-13 20:03:40,314 INFO L175 Difference]: Start difference. First operand has 100 places, 196 transitions, 2590 flow. Second operand 6 states and 109 transitions. [2025-04-13 20:03:40,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 301 transitions, 4296 flow [2025-04-13 20:03:40,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 301 transitions, 4249 flow, removed 22 selfloop flow, removed 3 redundant places. [2025-04-13 20:03:40,372 INFO L231 Difference]: Finished difference. Result has 104 places, 187 transitions, 2651 flow [2025-04-13 20:03:40,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2651, PETRI_PLACES=104, PETRI_TRANSITIONS=187} [2025-04-13 20:03:40,373 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2025-04-13 20:03:40,373 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 187 transitions, 2651 flow [2025-04-13 20:03:40,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:40,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:40,373 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:40,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:03:40,373 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:03:40,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash 22673622, now seen corresponding path program 2 times [2025-04-13 20:03:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:40,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46032288] [2025-04-13 20:03:40,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:03:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:40,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:03:40,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 20:03:40,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:03:40,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:40,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46032288] [2025-04-13 20:03:40,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46032288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:03:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953902252] [2025-04-13 20:03:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:40,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:03:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:40,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:03:40,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:03:40,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:40,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 187 transitions, 2651 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:40,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:40,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:41,014 INFO L116 PetriNetUnfolderBase]: 1972/2926 cut-off events. [2025-04-13 20:03:41,014 INFO L117 PetriNetUnfolderBase]: For 20398/20398 co-relation queries the response was YES. [2025-04-13 20:03:41,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17706 conditions, 2926 events. 1972/2926 cut-off events. For 20398/20398 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 13664 event pairs, 451 based on Foata normal form. 7/2034 useless extension candidates. Maximal degree in co-relation 17584. Up to 2392 conditions per place. [2025-04-13 20:03:41,026 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 179 selfloop transitions, 5 changer transitions 40/224 dead transitions. [2025-04-13 20:03:41,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 224 transitions, 3448 flow [2025-04-13 20:03:41,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:03:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:03:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-13 20:03:41,026 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-04-13 20:03:41,027 INFO L175 Difference]: Start difference. First operand has 104 places, 187 transitions, 2651 flow. Second operand 4 states and 67 transitions. [2025-04-13 20:03:41,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 224 transitions, 3448 flow [2025-04-13 20:03:41,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 224 transitions, 3323 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-04-13 20:03:41,073 INFO L231 Difference]: Finished difference. Result has 105 places, 174 transitions, 2329 flow [2025-04-13 20:03:41,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2329, PETRI_PLACES=105, PETRI_TRANSITIONS=174} [2025-04-13 20:03:41,073 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2025-04-13 20:03:41,074 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 174 transitions, 2329 flow [2025-04-13 20:03:41,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:41,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:41,074 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:41,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:03:41,074 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:03:41,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1418448654, now seen corresponding path program 3 times [2025-04-13 20:03:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:41,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467256854] [2025-04-13 20:03:41,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:41,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 20:03:41,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 20:03:41,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:03:41,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:41,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467256854] [2025-04-13 20:03:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467256854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975916438] [2025-04-13 20:03:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:41,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:41,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:41,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:41,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:41,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 174 transitions, 2329 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:41,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:41,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:41,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:41,799 INFO L116 PetriNetUnfolderBase]: 1696/2486 cut-off events. [2025-04-13 20:03:41,799 INFO L117 PetriNetUnfolderBase]: For 14941/14941 co-relation queries the response was YES. [2025-04-13 20:03:41,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14700 conditions, 2486 events. 1696/2486 cut-off events. For 14941/14941 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 10978 event pairs, 160 based on Foata normal form. 11/1757 useless extension candidates. Maximal degree in co-relation 14604. Up to 1564 conditions per place. [2025-04-13 20:03:41,809 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 165 selfloop transitions, 14 changer transitions 44/223 dead transitions. [2025-04-13 20:03:41,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 223 transitions, 3139 flow [2025-04-13 20:03:41,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-13 20:03:41,809 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2025-04-13 20:03:41,809 INFO L175 Difference]: Start difference. First operand has 105 places, 174 transitions, 2329 flow. Second operand 5 states and 82 transitions. [2025-04-13 20:03:41,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 223 transitions, 3139 flow [2025-04-13 20:03:41,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 223 transitions, 3019 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-13 20:03:41,852 INFO L231 Difference]: Finished difference. Result has 103 places, 142 transitions, 1794 flow [2025-04-13 20:03:41,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1794, PETRI_PLACES=103, PETRI_TRANSITIONS=142} [2025-04-13 20:03:41,852 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2025-04-13 20:03:41,852 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 142 transitions, 1794 flow [2025-04-13 20:03:41,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:41,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:41,853 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:41,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:03:41,853 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:03:41,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 401603836, now seen corresponding path program 2 times [2025-04-13 20:03:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:41,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123539533] [2025-04-13 20:03:41,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:03:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:41,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 20:03:41,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 20:03:41,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:03:41,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:41,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:41,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123539533] [2025-04-13 20:03:41,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123539533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:41,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:41,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79497681] [2025-04-13 20:03:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:41,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:41,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:41,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:41,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 142 transitions, 1794 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:41,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:41,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:41,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:42,389 INFO L116 PetriNetUnfolderBase]: 1464/2150 cut-off events. [2025-04-13 20:03:42,389 INFO L117 PetriNetUnfolderBase]: For 12393/12393 co-relation queries the response was YES. [2025-04-13 20:03:42,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12545 conditions, 2150 events. 1464/2150 cut-off events. For 12393/12393 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9068 event pairs, 364 based on Foata normal form. 1/1486 useless extension candidates. Maximal degree in co-relation 12504. Up to 1962 conditions per place. [2025-04-13 20:03:42,397 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 139 selfloop transitions, 4 changer transitions 19/162 dead transitions. [2025-04-13 20:03:42,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 162 transitions, 2261 flow [2025-04-13 20:03:42,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-13 20:03:42,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-04-13 20:03:42,398 INFO L175 Difference]: Start difference. First operand has 103 places, 142 transitions, 1794 flow. Second operand 5 states and 65 transitions. [2025-04-13 20:03:42,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 162 transitions, 2261 flow [2025-04-13 20:03:42,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 162 transitions, 2084 flow, removed 22 selfloop flow, removed 9 redundant places. [2025-04-13 20:03:42,429 INFO L231 Difference]: Finished difference. Result has 95 places, 135 transitions, 1531 flow [2025-04-13 20:03:42,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1531, PETRI_PLACES=95, PETRI_TRANSITIONS=135} [2025-04-13 20:03:42,430 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2025-04-13 20:03:42,430 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 135 transitions, 1531 flow [2025-04-13 20:03:42,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:42,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:42,430 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:42,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:03:42,430 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:03:42,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash -580655000, now seen corresponding path program 3 times [2025-04-13 20:03:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:42,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866200553] [2025-04-13 20:03:42,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:42,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 20:03:42,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 20:03:42,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:03:42,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:42,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:42,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866200553] [2025-04-13 20:03:42,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866200553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:42,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:42,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:03:42,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508353895] [2025-04-13 20:03:42,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:42,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:03:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:42,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:03:42,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:03:42,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:42,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 135 transitions, 1531 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:42,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:42,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:42,931 INFO L116 PetriNetUnfolderBase]: 1318/1915 cut-off events. [2025-04-13 20:03:42,931 INFO L117 PetriNetUnfolderBase]: For 8950/8950 co-relation queries the response was YES. [2025-04-13 20:03:42,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10127 conditions, 1915 events. 1318/1915 cut-off events. For 8950/8950 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7622 event pairs, 139 based on Foata normal form. 15/1330 useless extension candidates. Maximal degree in co-relation 10092. Up to 1149 conditions per place. [2025-04-13 20:03:42,937 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 107 selfloop transitions, 7 changer transitions 47/161 dead transitions. [2025-04-13 20:03:42,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 161 transitions, 2041 flow [2025-04-13 20:03:42,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:03:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:03:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-13 20:03:42,938 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2025-04-13 20:03:42,938 INFO L175 Difference]: Start difference. First operand has 95 places, 135 transitions, 1531 flow. Second operand 5 states and 68 transitions. [2025-04-13 20:03:42,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 161 transitions, 2041 flow [2025-04-13 20:03:42,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 161 transitions, 1895 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-04-13 20:03:42,957 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 948 flow [2025-04-13 20:03:42,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2025-04-13 20:03:42,957 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2025-04-13 20:03:42,957 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 948 flow [2025-04-13 20:03:42,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:03:42,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:42,957 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:42,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:03:42,957 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:03:42,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -107528886, now seen corresponding path program 1 times [2025-04-13 20:03:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:42,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041685584] [2025-04-13 20:03:42,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:42,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:03:42,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:03:42,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:43,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:43,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041685584] [2025-04-13 20:03:43,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041685584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:43,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:43,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:03:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712487743] [2025-04-13 20:03:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:43,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:03:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:43,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:03:43,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:03:43,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:43,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:43,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:43,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:43,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:43,365 INFO L116 PetriNetUnfolderBase]: 1206/1734 cut-off events. [2025-04-13 20:03:43,365 INFO L117 PetriNetUnfolderBase]: For 5684/5684 co-relation queries the response was YES. [2025-04-13 20:03:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 1734 events. 1206/1734 cut-off events. For 5684/5684 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6573 event pairs, 247 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 8584. Up to 1448 conditions per place. [2025-04-13 20:03:43,372 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 121 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2025-04-13 20:03:43,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 1517 flow [2025-04-13 20:03:43,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:03:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:03:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-13 20:03:43,373 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-13 20:03:43,373 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 948 flow. Second operand 3 states and 48 transitions. [2025-04-13 20:03:43,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 1517 flow [2025-04-13 20:03:43,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 134 transitions, 1257 flow, removed 32 selfloop flow, removed 14 redundant places. [2025-04-13 20:03:43,383 INFO L231 Difference]: Finished difference. Result has 64 places, 103 transitions, 827 flow [2025-04-13 20:03:43,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=64, PETRI_TRANSITIONS=103} [2025-04-13 20:03:43,383 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2025-04-13 20:03:43,383 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 103 transitions, 827 flow [2025-04-13 20:03:43,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:43,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:43,384 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:03:43,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:03:43,384 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:03:43,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1829991768, now seen corresponding path program 1 times [2025-04-13 20:03:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:43,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320376291] [2025-04-13 20:03:43,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:43,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:03:43,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:03:43,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:43,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:03:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:43,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320376291] [2025-04-13 20:03:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320376291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:43,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:03:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823588616] [2025-04-13 20:03:43,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:43,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:03:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:43,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:03:43,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:03:43,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:43,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 103 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:43,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:43,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:43,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:43,862 INFO L116 PetriNetUnfolderBase]: 1270/1847 cut-off events. [2025-04-13 20:03:43,862 INFO L117 PetriNetUnfolderBase]: For 3991/3991 co-relation queries the response was YES. [2025-04-13 20:03:43,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 1847 events. 1270/1847 cut-off events. For 3991/3991 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7151 event pairs, 325 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 7848. Up to 1533 conditions per place. [2025-04-13 20:03:43,870 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 115 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-04-13 20:03:43,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 1262 flow [2025-04-13 20:03:43,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:03:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:03:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 20:03:43,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2025-04-13 20:03:43,871 INFO L175 Difference]: Start difference. First operand has 64 places, 103 transitions, 827 flow. Second operand 3 states and 47 transitions. [2025-04-13 20:03:43,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 1262 flow [2025-04-13 20:03:43,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 128 transitions, 1205 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:03:43,877 INFO L231 Difference]: Finished difference. Result has 65 places, 105 transitions, 859 flow [2025-04-13 20:03:43,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=65, PETRI_TRANSITIONS=105} [2025-04-13 20:03:43,878 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2025-04-13 20:03:43,878 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 105 transitions, 859 flow [2025-04-13 20:03:43,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:43,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:43,878 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:03:43,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:03:43,878 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:03:43,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1820147662, now seen corresponding path program 1 times [2025-04-13 20:03:43,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:43,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795180366] [2025-04-13 20:03:43,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:43,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:43,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:03:43,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:03:43,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:43,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 20:03:44,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:44,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795180366] [2025-04-13 20:03:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795180366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:03:44,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:03:44,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:03:44,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991594184] [2025-04-13 20:03:44,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:03:44,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:03:44,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:44,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:03:44,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:03:44,052 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:44,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 105 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:03:44,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:44,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:44,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:44,433 INFO L116 PetriNetUnfolderBase]: 1423/2075 cut-off events. [2025-04-13 20:03:44,433 INFO L117 PetriNetUnfolderBase]: For 4981/4981 co-relation queries the response was YES. [2025-04-13 20:03:44,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 2075 events. 1423/2075 cut-off events. For 4981/4981 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8250 event pairs, 351 based on Foata normal form. 0/1521 useless extension candidates. Maximal degree in co-relation 8748. Up to 1770 conditions per place. [2025-04-13 20:03:44,440 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 115 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-04-13 20:03:44,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 128 transitions, 1286 flow [2025-04-13 20:03:44,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:03:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:03:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-13 20:03:44,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2025-04-13 20:03:44,441 INFO L175 Difference]: Start difference. First operand has 65 places, 105 transitions, 859 flow. Second operand 3 states and 46 transitions. [2025-04-13 20:03:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 128 transitions, 1286 flow [2025-04-13 20:03:44,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 1256 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:44,450 INFO L231 Difference]: Finished difference. Result has 67 places, 111 transitions, 941 flow [2025-04-13 20:03:44,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=67, PETRI_TRANSITIONS=111} [2025-04-13 20:03:44,450 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2025-04-13 20:03:44,450 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 111 transitions, 941 flow [2025-04-13 20:03:44,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:03:44,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:44,451 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:03:44,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:03:44,451 INFO L403 AbstractCegarLoop]: === Iteration 21 === 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:03:44,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1263520870, now seen corresponding path program 1 times [2025-04-13 20:03:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:44,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923096069] [2025-04-13 20:03:44,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:44,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:03:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:03:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:50,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:50,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923096069] [2025-04-13 20:03:50,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923096069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:50,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489646187] [2025-04-13 20:03:50,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:03:50,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:50,600 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:03:50,602 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:03:50,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:03:50,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:03:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:50,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 20:03:50,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:53,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:03:53,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 376 treesize of output 724 [2025-04-13 20:03:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:56,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:58,291 INFO L325 Elim1Store]: treesize reduction 4, result has 97.9 percent of original size [2025-04-13 20:03:58,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 330 [2025-04-13 20:03:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489646187] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:03:58,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:03:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 10, 10] total 47 [2025-04-13 20:03:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879364019] [2025-04-13 20:03:58,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:03:58,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 20:03:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:58,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 20:03:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2077, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 20:03:58,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:03:58,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 111 transitions, 941 flow. Second operand has 48 states, 48 states have (on average 4.6875) internal successors, (225), 48 states have internal predecessors, (225), 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:03:58,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:58,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:03:58,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:18,693 INFO L116 PetriNetUnfolderBase]: 3509/5126 cut-off events. [2025-04-13 20:04:18,693 INFO L117 PetriNetUnfolderBase]: For 10784/10784 co-relation queries the response was YES. [2025-04-13 20:04:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20956 conditions, 5126 events. 3509/5126 cut-off events. For 10784/10784 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 25139 event pairs, 146 based on Foata normal form. 6/3616 useless extension candidates. Maximal degree in co-relation 20933. Up to 1874 conditions per place. [2025-04-13 20:04:18,712 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 431 selfloop transitions, 377 changer transitions 19/827 dead transitions. [2025-04-13 20:04:18,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 827 transitions, 7423 flow [2025-04-13 20:04:18,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 20:04:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-04-13 20:04:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 800 transitions. [2025-04-13 20:04:18,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26936026936026936 [2025-04-13 20:04:18,715 INFO L175 Difference]: Start difference. First operand has 67 places, 111 transitions, 941 flow. Second operand 90 states and 800 transitions. [2025-04-13 20:04:18,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 827 transitions, 7423 flow [2025-04-13 20:04:18,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 827 transitions, 7216 flow, removed 57 selfloop flow, removed 1 redundant places. [2025-04-13 20:04:18,750 INFO L231 Difference]: Finished difference. Result has 183 places, 464 transitions, 4874 flow [2025-04-13 20:04:18,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4874, PETRI_PLACES=183, PETRI_TRANSITIONS=464} [2025-04-13 20:04:18,750 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2025-04-13 20:04:18,750 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 464 transitions, 4874 flow [2025-04-13 20:04:18,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.6875) internal successors, (225), 48 states have internal predecessors, (225), 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:04:18,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:18,751 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:18,761 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:04:18,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:18,951 INFO L403 AbstractCegarLoop]: === Iteration 22 === 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:04:18,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1194828180, now seen corresponding path program 2 times [2025-04-13 20:04:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:18,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592969196] [2025-04-13 20:04:18,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:04:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:18,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:04:19,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:04:19,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:04:19,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 20:04:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:21,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592969196] [2025-04-13 20:04:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592969196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:21,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205913718] [2025-04-13 20:04:21,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:04:21,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:21,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:21,933 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:04:21,934 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:04:22,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:04:22,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:04:22,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:04:22,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:22,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:04:22,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:22,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:04:22,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 314 treesize of output 374 [2025-04-13 20:04:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:04:23,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:24,489 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:04:24,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 291 [2025-04-13 20:04:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:04:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205913718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:25,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 32 [2025-04-13 20:04:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336931650] [2025-04-13 20:04:25,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:25,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:04:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:25,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:04:25,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:04:25,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:04:25,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 464 transitions, 4874 flow. Second operand has 33 states, 33 states have (on average 5.454545454545454) internal successors, (180), 33 states have internal predecessors, (180), 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:04:25,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:25,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:04:25,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:27,647 INFO L116 PetriNetUnfolderBase]: 4170/6146 cut-off events. [2025-04-13 20:04:27,647 INFO L117 PetriNetUnfolderBase]: For 50228/50228 co-relation queries the response was YES. [2025-04-13 20:04:27,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33659 conditions, 6146 events. 4170/6146 cut-off events. For 50228/50228 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 31901 event pairs, 757 based on Foata normal form. 3/5023 useless extension candidates. Maximal degree in co-relation 33608. Up to 4614 conditions per place. [2025-04-13 20:04:27,679 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 440 selfloop transitions, 292 changer transitions 3/735 dead transitions. [2025-04-13 20:04:27,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 735 transitions, 9043 flow [2025-04-13 20:04:27,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:04:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:04:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 205 transitions. [2025-04-13 20:04:27,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2588383838383838 [2025-04-13 20:04:27,680 INFO L175 Difference]: Start difference. First operand has 183 places, 464 transitions, 4874 flow. Second operand 24 states and 205 transitions. [2025-04-13 20:04:27,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 735 transitions, 9043 flow [2025-04-13 20:04:27,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 735 transitions, 8142 flow, removed 391 selfloop flow, removed 10 redundant places. [2025-04-13 20:04:27,993 INFO L231 Difference]: Finished difference. Result has 201 places, 658 transitions, 7074 flow [2025-04-13 20:04:27,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4211, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7074, PETRI_PLACES=201, PETRI_TRANSITIONS=658} [2025-04-13 20:04:27,994 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2025-04-13 20:04:27,994 INFO L485 AbstractCegarLoop]: Abstraction has has 201 places, 658 transitions, 7074 flow [2025-04-13 20:04:27,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.454545454545454) internal successors, (180), 33 states have internal predecessors, (180), 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:04:27,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:27,994 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:28,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:04:28,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:28,195 INFO L403 AbstractCegarLoop]: === Iteration 23 === 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:04:28,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -149498396, now seen corresponding path program 3 times [2025-04-13 20:04:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:28,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582636545] [2025-04-13 20:04:28,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:04:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:28,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:04:28,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 20:04:28,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:04:28,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:04:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:29,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582636545] [2025-04-13 20:04:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582636545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:29,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465533286] [2025-04-13 20:04:29,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:04:29,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:29,976 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:04:29,977 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:04:30,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:04:30,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 20:04:30,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:04:30,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:30,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 20:04:30,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:30,956 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:04:30,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 241 [2025-04-13 20:04:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:04:31,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:32,327 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-13 20:04:32,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 194 [2025-04-13 20:04:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:04:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465533286] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:32,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 23 [2025-04-13 20:04:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769002292] [2025-04-13 20:04:32,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:32,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:04:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:32,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:04:32,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:04:32,673 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:04:32,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 658 transitions, 7074 flow. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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:04:32,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:32,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:04:32,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:35,380 INFO L116 PetriNetUnfolderBase]: 5123/7696 cut-off events. [2025-04-13 20:04:35,381 INFO L117 PetriNetUnfolderBase]: For 79014/79014 co-relation queries the response was YES. [2025-04-13 20:04:35,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44379 conditions, 7696 events. 5123/7696 cut-off events. For 79014/79014 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 43258 event pairs, 479 based on Foata normal form. 5/7212 useless extension candidates. Maximal degree in co-relation 44326. Up to 2981 conditions per place. [2025-04-13 20:04:35,427 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 486 selfloop transitions, 380 changer transitions 9/875 dead transitions. [2025-04-13 20:04:35,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 875 transitions, 11061 flow [2025-04-13 20:04:35,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:04:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:04:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 170 transitions. [2025-04-13 20:04:35,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-04-13 20:04:35,429 INFO L175 Difference]: Start difference. First operand has 201 places, 658 transitions, 7074 flow. Second operand 15 states and 170 transitions. [2025-04-13 20:04:35,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 875 transitions, 11061 flow [2025-04-13 20:04:35,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 875 transitions, 10914 flow, removed 61 selfloop flow, removed 9 redundant places. [2025-04-13 20:04:35,887 INFO L231 Difference]: Finished difference. Result has 213 places, 744 transitions, 9265 flow [2025-04-13 20:04:35,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6949, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9265, PETRI_PLACES=213, PETRI_TRANSITIONS=744} [2025-04-13 20:04:35,887 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2025-04-13 20:04:35,887 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 744 transitions, 9265 flow [2025-04-13 20:04:35,887 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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:04:35,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:35,887 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:35,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:04:36,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 20:04:36,088 INFO L403 AbstractCegarLoop]: === Iteration 24 === 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:04:36,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1890315522, now seen corresponding path program 4 times [2025-04-13 20:04:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:36,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634641809] [2025-04-13 20:04:36,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:04:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:36,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:04:36,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:04:36,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:04:36,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 20:04:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:39,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634641809] [2025-04-13 20:04:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634641809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:39,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488072978] [2025-04-13 20:04:39,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:04:39,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:39,681 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:04:39,682 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:04:39,862 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:04:39,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:04:39,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:04:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:39,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 20:04:39,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:41,402 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:04:41,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 253 treesize of output 277 [2025-04-13 20:04:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:04:41,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:43,658 INFO L325 Elim1Store]: treesize reduction 32, result has 71.7 percent of original size [2025-04-13 20:04:43,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 277 treesize of output 291 [2025-04-13 20:04:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:04:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488072978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:44,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 38 [2025-04-13 20:04:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527961224] [2025-04-13 20:04:44,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:44,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:04:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:44,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:04:44,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:04:44,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:04:44,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 744 transitions, 9265 flow. Second operand has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 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:04:44,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:44,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:04:44,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:58,319 INFO L116 PetriNetUnfolderBase]: 6091/9308 cut-off events. [2025-04-13 20:04:58,320 INFO L117 PetriNetUnfolderBase]: For 123468/123468 co-relation queries the response was YES. [2025-04-13 20:04:58,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61346 conditions, 9308 events. 6091/9308 cut-off events. For 123468/123468 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 55902 event pairs, 309 based on Foata normal form. 27/8785 useless extension candidates. Maximal degree in co-relation 61286. Up to 3621 conditions per place. [2025-04-13 20:04:58,381 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 541 selfloop transitions, 650 changer transitions 112/1303 dead transitions. [2025-04-13 20:04:58,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 1303 transitions, 18566 flow [2025-04-13 20:04:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 20:04:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-04-13 20:04:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 637 transitions. [2025-04-13 20:04:58,383 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2680976430976431 [2025-04-13 20:04:58,383 INFO L175 Difference]: Start difference. First operand has 213 places, 744 transitions, 9265 flow. Second operand 72 states and 637 transitions. [2025-04-13 20:04:58,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 1303 transitions, 18566 flow [2025-04-13 20:04:59,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1303 transitions, 18455 flow, removed 54 selfloop flow, removed 2 redundant places. [2025-04-13 20:04:59,233 INFO L231 Difference]: Finished difference. Result has 310 places, 932 transitions, 14212 flow [2025-04-13 20:04:59,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9224, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=14212, PETRI_PLACES=310, PETRI_TRANSITIONS=932} [2025-04-13 20:04:59,234 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 280 predicate places. [2025-04-13 20:04:59,234 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 932 transitions, 14212 flow [2025-04-13 20:04:59,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 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:04:59,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:59,234 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:59,242 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:04:59,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:59,435 INFO L403 AbstractCegarLoop]: === Iteration 25 === 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:04:59,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1331719490, now seen corresponding path program 5 times [2025-04-13 20:04:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:59,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861325960] [2025-04-13 20:04:59,435 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:04:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:59,451 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:04:59,541 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:04:59,541 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:04:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:05:01,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:01,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861325960] [2025-04-13 20:05:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861325960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:05:01,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739041021] [2025-04-13 20:05:01,197 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:05:01,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:05:01,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:05:01,199 INFO L229 MonitoredProcess]: Starting monitored process 8 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:05:01,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:05:01,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:05:01,552 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:05:01,552 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:05:01,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:01,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 20:05:01,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:05:02,278 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:05:02,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 239 treesize of output 287 [2025-04-13 20:05:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:05:02,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:05:03,711 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-13 20:05:03,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 258 treesize of output 227 [2025-04-13 20:05:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:05:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739041021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:05:04,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:05:04,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 20 [2025-04-13 20:05:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298025864] [2025-04-13 20:05:04,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:05:04,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:05:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:04,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:05:04,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:05:04,091 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:05:04,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 932 transitions, 14212 flow. Second operand has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 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:05:04,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:04,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:05:04,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:07,959 INFO L116 PetriNetUnfolderBase]: 6649/10131 cut-off events. [2025-04-13 20:05:07,960 INFO L117 PetriNetUnfolderBase]: For 190229/190229 co-relation queries the response was YES. [2025-04-13 20:05:08,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76290 conditions, 10131 events. 6649/10131 cut-off events. For 190229/190229 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 61616 event pairs, 440 based on Foata normal form. 19/9966 useless extension candidates. Maximal degree in co-relation 76202. Up to 4266 conditions per place. [2025-04-13 20:05:08,048 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 719 selfloop transitions, 419 changer transitions 113/1251 dead transitions. [2025-04-13 20:05:08,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1251 transitions, 20690 flow [2025-04-13 20:05:08,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:05:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:05:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2025-04-13 20:05:08,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34402852049910876 [2025-04-13 20:05:08,050 INFO L175 Difference]: Start difference. First operand has 310 places, 932 transitions, 14212 flow. Second operand 17 states and 193 transitions. [2025-04-13 20:05:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1251 transitions, 20690 flow [2025-04-13 20:05:09,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 1251 transitions, 19587 flow, removed 491 selfloop flow, removed 27 redundant places. [2025-04-13 20:05:09,445 INFO L231 Difference]: Finished difference. Result has 294 places, 966 transitions, 14671 flow [2025-04-13 20:05:09,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13299, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=337, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=14671, PETRI_PLACES=294, PETRI_TRANSITIONS=966} [2025-04-13 20:05:09,446 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 264 predicate places. [2025-04-13 20:05:09,446 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 966 transitions, 14671 flow [2025-04-13 20:05:09,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 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:05:09,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:05:09,446 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:05:09,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:05:09,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:05:09,647 INFO L403 AbstractCegarLoop]: === Iteration 26 === 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:05:09,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:05:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 265952336, now seen corresponding path program 6 times [2025-04-13 20:05:09,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:05:09,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510979686] [2025-04-13 20:05:09,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:05:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:05:09,663 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:05:09,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 20:05:09,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:05:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:05:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:11,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510979686] [2025-04-13 20:05:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510979686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:05:11,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960392044] [2025-04-13 20:05:11,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:05:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:05:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:05:11,599 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:11,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:05:11,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:05:11,854 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 20:05:11,854 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:05:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:11,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 20:05:11,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:05:13,001 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:05:13,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 319 treesize of output 539 [2025-04-13 20:05:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:05:14,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:05:15,537 INFO L325 Elim1Store]: treesize reduction 5, result has 95.9 percent of original size [2025-04-13 20:05:15,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 193 [2025-04-13 20:05:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:05:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960392044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:05:15,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:05:15,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 26 [2025-04-13 20:05:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809142214] [2025-04-13 20:05:15,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:05:15,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:05:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:15,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:05:15,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:05:15,701 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:05:15,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 966 transitions, 14671 flow. Second operand has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 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:05:15,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:15,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:05:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:25,376 INFO L116 PetriNetUnfolderBase]: 9650/15265 cut-off events. [2025-04-13 20:05:25,376 INFO L117 PetriNetUnfolderBase]: For 297344/297344 co-relation queries the response was YES. [2025-04-13 20:05:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116824 conditions, 15265 events. 9650/15265 cut-off events. For 297344/297344 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 106270 event pairs, 752 based on Foata normal form. 68/15102 useless extension candidates. Maximal degree in co-relation 116740. Up to 6778 conditions per place. [2025-04-13 20:05:25,535 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 1120 selfloop transitions, 587 changer transitions 231/1938 dead transitions. [2025-04-13 20:05:25,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 1938 transitions, 31928 flow [2025-04-13 20:05:25,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 20:05:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-04-13 20:05:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 560 transitions. [2025-04-13 20:05:25,536 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29258098223615464 [2025-04-13 20:05:25,536 INFO L175 Difference]: Start difference. First operand has 294 places, 966 transitions, 14671 flow. Second operand 58 states and 560 transitions. [2025-04-13 20:05:25,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 1938 transitions, 31928 flow [2025-04-13 20:05:28,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1938 transitions, 31539 flow, removed 193 selfloop flow, removed 5 redundant places. [2025-04-13 20:05:28,413 INFO L231 Difference]: Finished difference. Result has 363 places, 1257 transitions, 21302 flow [2025-04-13 20:05:28,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=14522, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=966, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=21302, PETRI_PLACES=363, PETRI_TRANSITIONS=1257} [2025-04-13 20:05:28,414 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 333 predicate places. [2025-04-13 20:05:28,414 INFO L485 AbstractCegarLoop]: Abstraction has has 363 places, 1257 transitions, 21302 flow [2025-04-13 20:05:28,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 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:05:28,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:05:28,414 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:05:28,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:05:28,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:05:28,615 INFO L403 AbstractCegarLoop]: === Iteration 27 === 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:05:28,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:05:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash -554476000, now seen corresponding path program 7 times [2025-04-13 20:05:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:05:28,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971713032] [2025-04-13 20:05:28,616 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:05:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:05:28,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:05:28,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:05:28,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:05:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:05:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:35,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971713032] [2025-04-13 20:05:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971713032] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:05:35,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795353356] [2025-04-13 20:05:35,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:05:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:05:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:05:35,038 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05:35,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:05:35,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:05:35,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:05:35,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:05:35,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:35,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:05:35,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:05:36,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:05:36,058 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 383 treesize of output 555 [2025-04-13 20:05:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:05:37,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:05:43,425 INFO L325 Elim1Store]: treesize reduction 5, result has 95.9 percent of original size [2025-04-13 20:05:43,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 193 [2025-04-13 20:05:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:05:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795353356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:05:43,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:05:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 8] total 43 [2025-04-13 20:05:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145380296] [2025-04-13 20:05:43,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:05:43,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 20:05:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:43,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 20:05:43,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1694, Unknown=1, NotChecked=0, Total=1892 [2025-04-13 20:05:43,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:05:43,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1257 transitions, 21302 flow. Second operand has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 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:05:43,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:43,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:05:43,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:53,205 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:05:58,290 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:06:10,533 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:06:14,757 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:06:23,713 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:06:25,416 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:06:46,045 INFO L116 PetriNetUnfolderBase]: 23203/36584 cut-off events. [2025-04-13 20:06:46,045 INFO L117 PetriNetUnfolderBase]: For 835969/835969 co-relation queries the response was YES. [2025-04-13 20:06:46,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304103 conditions, 36584 events. 23203/36584 cut-off events. For 835969/835969 co-relation queries the response was YES. Maximal size of possible extension queue 2463. Compared 286694 event pairs, 1992 based on Foata normal form. 84/36168 useless extension candidates. Maximal degree in co-relation 303997. Up to 16305 conditions per place. [2025-04-13 20:06:46,953 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 2497 selfloop transitions, 1358 changer transitions 257/4112 dead transitions. [2025-04-13 20:06:46,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 4112 transitions, 75661 flow [2025-04-13 20:06:46,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-04-13 20:06:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2025-04-13 20:06:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 797 transitions. [2025-04-13 20:06:46,956 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27444903581267216 [2025-04-13 20:06:46,956 INFO L175 Difference]: Start difference. First operand has 363 places, 1257 transitions, 21302 flow. Second operand 88 states and 797 transitions. [2025-04-13 20:06:46,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 4112 transitions, 75661 flow [2025-04-13 20:07:12,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 4112 transitions, 71854 flow, removed 1829 selfloop flow, removed 7 redundant places. [2025-04-13 20:07:12,726 INFO L231 Difference]: Finished difference. Result has 472 places, 2182 transitions, 40438 flow [2025-04-13 20:07:12,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=19861, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=491, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=40438, PETRI_PLACES=472, PETRI_TRANSITIONS=2182} [2025-04-13 20:07:12,727 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 442 predicate places. [2025-04-13 20:07:12,727 INFO L485 AbstractCegarLoop]: Abstraction has has 472 places, 2182 transitions, 40438 flow [2025-04-13 20:07:12,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 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:07:12,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:12,728 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:07:12,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:07:12,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:07:12,932 INFO L403 AbstractCegarLoop]: === Iteration 28 === 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:07:12,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 609405184, now seen corresponding path program 8 times [2025-04-13 20:07:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:12,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378740055] [2025-04-13 20:07:12,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:07:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:12,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 20:07:13,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:07:13,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:07:13,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 20:07:17,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:17,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378740055] [2025-04-13 20:07:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378740055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:07:17,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071586482] [2025-04-13 20:07:17,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:07:17,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:07:17,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:07:17,510 INFO L229 MonitoredProcess]: Starting monitored process 11 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:07:17,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:07:17,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 20:07:17,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:07:17,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:07:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:17,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 20:07:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:07:22,738 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:07:22,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 152 [2025-04-13 20:07:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:07:23,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:07:25,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:07:25,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 218 [2025-04-13 20:07:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:07:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071586482] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:07:27,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:07:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 7] total 29 [2025-04-13 20:07:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093487963] [2025-04-13 20:07:27,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:07:27,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:07:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:07:27,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2025-04-13 20:07:27,594 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:27,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 2182 transitions, 40438 flow. Second operand has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 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:07:27,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:27,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:27,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:56,626 INFO L116 PetriNetUnfolderBase]: 22927/36030 cut-off events. [2025-04-13 20:07:56,626 INFO L117 PetriNetUnfolderBase]: For 757179/757179 co-relation queries the response was YES. [2025-04-13 20:07:57,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299967 conditions, 36030 events. 22927/36030 cut-off events. For 757179/757179 co-relation queries the response was YES. Maximal size of possible extension queue 2332. Compared 279221 event pairs, 2827 based on Foata normal form. 54/35572 useless extension candidates. Maximal degree in co-relation 299827. Up to 16097 conditions per place. [2025-04-13 20:07:57,576 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 1679 selfloop transitions, 628 changer transitions 89/2396 dead transitions. [2025-04-13 20:07:57,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 2396 transitions, 48976 flow [2025-04-13 20:07:57,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:07:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:07:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 176 transitions. [2025-04-13 20:07:57,578 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2807017543859649 [2025-04-13 20:07:57,578 INFO L175 Difference]: Start difference. First operand has 472 places, 2182 transitions, 40438 flow. Second operand 19 states and 176 transitions. [2025-04-13 20:07:57,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 2396 transitions, 48976 flow [2025-04-13 20:08:17,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 2396 transitions, 46651 flow, removed 921 selfloop flow, removed 26 redundant places. [2025-04-13 20:08:17,451 INFO L231 Difference]: Finished difference. Result has 457 places, 2149 transitions, 39140 flow [2025-04-13 20:08:17,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=38400, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=628, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=39140, PETRI_PLACES=457, PETRI_TRANSITIONS=2149} [2025-04-13 20:08:17,453 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 427 predicate places. [2025-04-13 20:08:17,453 INFO L485 AbstractCegarLoop]: Abstraction has has 457 places, 2149 transitions, 39140 flow [2025-04-13 20:08:17,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 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:08:17,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:08:17,454 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:08:17,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:08:17,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:08:17,656 INFO L403 AbstractCegarLoop]: === Iteration 29 === 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:08:17,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:08:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2058510500, now seen corresponding path program 9 times [2025-04-13 20:08:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:08:17,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31020816] [2025-04-13 20:08:17,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:08:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:08:17,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:08:17,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 20:08:17,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:08:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:08:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:21,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31020816] [2025-04-13 20:08:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31020816] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:08:21,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106912871] [2025-04-13 20:08:21,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:08:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:08:21,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:08:21,757 INFO L229 MonitoredProcess]: Starting monitored process 12 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:08:21,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:08:21,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:08:22,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 20:08:22,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:08:22,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:22,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 20:08:22,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:08:30,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:08:30,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 145 [2025-04-13 20:08:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:08:30,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:08:34,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:08:34,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 228 treesize of output 298 [2025-04-13 20:08:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:08:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106912871] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:08:37,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:08:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 7] total 30 [2025-04-13 20:08:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469898251] [2025-04-13 20:08:37,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:08:37,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:08:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:37,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:08:37,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:08:37,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:08:37,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 2149 transitions, 39140 flow. Second operand has 31 states, 31 states have (on average 5.451612903225806) internal successors, (169), 31 states have internal predecessors, (169), 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:08:37,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:37,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:08:37,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:09:25,599 INFO L116 PetriNetUnfolderBase]: 22007/34335 cut-off events. [2025-04-13 20:09:25,600 INFO L117 PetriNetUnfolderBase]: For 700236/700236 co-relation queries the response was YES. [2025-04-13 20:09:26,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285982 conditions, 34335 events. 22007/34335 cut-off events. For 700236/700236 co-relation queries the response was YES. Maximal size of possible extension queue 2311. Compared 262310 event pairs, 2296 based on Foata normal form. 25/34004 useless extension candidates. Maximal degree in co-relation 285855. Up to 14803 conditions per place. [2025-04-13 20:09:26,333 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 1399 selfloop transitions, 1330 changer transitions 85/2814 dead transitions. [2025-04-13 20:09:26,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 2814 transitions, 55689 flow [2025-04-13 20:09:26,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 20:09:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 20:09:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 451 transitions. [2025-04-13 20:09:26,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2679738562091503 [2025-04-13 20:09:26,335 INFO L175 Difference]: Start difference. First operand has 457 places, 2149 transitions, 39140 flow. Second operand 51 states and 451 transitions. [2025-04-13 20:09:26,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 2814 transitions, 55689 flow [2025-04-13 20:09:41,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 2814 transitions, 54064 flow, removed 77 selfloop flow, removed 18 redundant places. [2025-04-13 20:09:41,546 INFO L231 Difference]: Finished difference. Result has 507 places, 2412 transitions, 46259 flow [2025-04-13 20:09:41,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=37888, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1098, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=46259, PETRI_PLACES=507, PETRI_TRANSITIONS=2412} [2025-04-13 20:09:41,550 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 477 predicate places. [2025-04-13 20:09:41,550 INFO L485 AbstractCegarLoop]: Abstraction has has 507 places, 2412 transitions, 46259 flow [2025-04-13 20:09:41,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.451612903225806) internal successors, (169), 31 states have internal predecessors, (169), 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:09:41,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:09:41,550 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:09:41,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:09:41,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:09:41,751 INFO L403 AbstractCegarLoop]: === Iteration 30 === 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:09:41,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:09:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1352248844, now seen corresponding path program 10 times [2025-04-13 20:09:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:09:41,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620039226] [2025-04-13 20:09:41,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:09:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:09:41,771 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:09:41,926 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:09:41,927 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:09:41,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:09:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 20:09:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:09:46,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620039226] [2025-04-13 20:09:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620039226] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:09:46,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007682205] [2025-04-13 20:09:46,556 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:09:46,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:09:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:09:46,559 INFO L229 MonitoredProcess]: Starting monitored process 13 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:09:46,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:09:46,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:09:46,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:09:46,845 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:09:46,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:09:46,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:09:46,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:09:50,848 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:09:50,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 352 treesize of output 536 [2025-04-13 20:09:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:09:56,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:10:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:10:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007682205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:10:02,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:10:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 7] total 28 [2025-04-13 20:10:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587446359] [2025-04-13 20:10:02,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:10:02,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:10:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:02,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:10:02,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:10:02,122 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:10:02,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 2412 transitions, 46259 flow. Second operand has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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:10:02,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:02,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:10:02,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:15,189 INFO L116 PetriNetUnfolderBase]: 49385/79009 cut-off events. [2025-04-13 20:12:15,190 INFO L117 PetriNetUnfolderBase]: For 1682572/1682572 co-relation queries the response was YES. [2025-04-13 20:12:17,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669117 conditions, 79009 events. 49385/79009 cut-off events. For 1682572/1682572 co-relation queries the response was YES. Maximal size of possible extension queue 5082. Compared 697934 event pairs, 2877 based on Foata normal form. 243/77884 useless extension candidates. Maximal degree in co-relation 668971. Up to 35537 conditions per place. [2025-04-13 20:12:17,820 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 2765 selfloop transitions, 3141 changer transitions 308/6214 dead transitions. [2025-04-13 20:12:17,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 6214 transitions, 125508 flow [2025-04-13 20:12:17,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 20:12:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 20:12:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 949 transitions. [2025-04-13 20:12:17,823 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29048056320783594 [2025-04-13 20:12:17,823 INFO L175 Difference]: Start difference. First operand has 507 places, 2412 transitions, 46259 flow. Second operand 99 states and 949 transitions. [2025-04-13 20:12:17,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 6214 transitions, 125508 flow [2025-04-13 20:13:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 6214 transitions, 123595 flow, removed 954 selfloop flow, removed 5 redundant places. [2025-04-13 20:13:37,549 INFO L231 Difference]: Finished difference. Result has 653 places, 4597 transitions, 97018 flow [2025-04-13 20:13:37,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=44906, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=97018, PETRI_PLACES=653, PETRI_TRANSITIONS=4597} [2025-04-13 20:13:37,551 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 623 predicate places. [2025-04-13 20:13:37,551 INFO L485 AbstractCegarLoop]: Abstraction has has 653 places, 4597 transitions, 97018 flow [2025-04-13 20:13:37,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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:13:37,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:37,552 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:13:37,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:13:37,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:37,753 INFO L403 AbstractCegarLoop]: === Iteration 31 === 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:13:37,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1558131062, now seen corresponding path program 11 times [2025-04-13 20:13:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:37,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401548678] [2025-04-13 20:13:37,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:37,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:13:38,393 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:13:38,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:13:38,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:13:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:45,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401548678] [2025-04-13 20:13:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401548678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:45,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480552463] [2025-04-13 20:13:45,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:45,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:45,356 INFO L229 MonitoredProcess]: Starting monitored process 14 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:13:45,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:13:45,659 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:13:45,903 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:13:45,903 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:13:45,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:45,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 20:13:45,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:52,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:52,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 338 treesize of output 366 [2025-04-13 20:13:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:13:57,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:00,353 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:14:00,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 329 treesize of output 378 [2025-04-13 20:14:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 20:14:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480552463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:02,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 20:14:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519217088] [2025-04-13 20:14:02,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:02,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:14:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:02,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:14:02,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:14:02,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:14:02,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 4597 transitions, 97018 flow. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 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:14:02,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:02,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:14:02,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 20:15:48,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 20:15:48,772 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:15:48,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:48,785 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:15:48,788 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:15:48,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-13 20:15:48,976 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. [2025-04-13 20:15:48,986 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:15:48,986 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:15:48,986 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:15:48,987 INFO L422 BasicCegarLoop]: Path program histogram: [11, 8, 3, 3, 2, 1, 1, 1, 1] [2025-04-13 20:15:48,999 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:15:48,999 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:15:49,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:15:49 BasicIcfg [2025-04-13 20:15:49,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:15:49,015 INFO L158 Benchmark]: Toolchain (without parser) took 744012.99ms. Allocated memory was 155.2MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 110.1MB in the beginning and 1.1GB in the end (delta: -972.1MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2025-04-13 20:15:49,015 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:15:49,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.21ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 91.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:15:49,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.35ms. Allocated memory is still 155.2MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:15:49,016 INFO L158 Benchmark]: Boogie Preprocessor took 75.74ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 82.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:15:49,016 INFO L158 Benchmark]: RCFGBuilder took 1600.39ms. Allocated memory was 155.2MB in the beginning and 343.9MB in the end (delta: 188.7MB). Free memory was 82.6MB in the beginning and 243.3MB in the end (delta: -160.7MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2025-04-13 20:15:49,017 INFO L158 Benchmark]: TraceAbstraction took 741935.64ms. Allocated memory was 343.9MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 243.3MB in the beginning and 1.1GB in the end (delta: -838.9MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2025-04-13 20:15:49,022 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.21ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 91.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.35ms. Allocated memory is still 155.2MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.74ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 82.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1600.39ms. Allocated memory was 155.2MB in the beginning and 343.9MB in the end (delta: 188.7MB). Free memory was 82.6MB in the beginning and 243.3MB in the end (delta: -160.7MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. * TraceAbstraction took 741935.64ms. Allocated memory was 343.9MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 243.3MB in the beginning and 1.1GB in the end (delta: -838.9MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 51 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: 741.8s, OverallIterations: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 595.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 3790 SdHoareTripleChecker+Valid, 109.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3790 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 103.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 616 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31542 IncrementalHoareTripleChecker+Invalid, 32163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 616 mSolverCounterUnsat, 0 mSDtfsCounter, 31542 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2088 GetRequests, 1151 SyntacticMatches, 6 SemanticMatches, 930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20833 ImplicationChecksByTransitivity, 174.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97018occurred in iteration=30, InterpolantAutomatonStates: 633, 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.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 137.2s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1334 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1922 ConstructedInterpolants, 51 QuantifiedInterpolants, 20836 SizeOfPredicates, 527 NumberOfNonLiveVariables, 5495 ConjunctsInSsa, 594 ConjunctsInUnsatCore, 57 InterpolantComputations, 18 PerfectInterpolantSequences, 2147/2440 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown