/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/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:50:41,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:50:41,160 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 19:50:41,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:50:41,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:50:41,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:50:41,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:50:41,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:50:41,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:50:41,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:50:41,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:50:41,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:50:41,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:50:41,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:50:41,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:50:41,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:50:41,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:50:41,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:41,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:41,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:50:41,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:50:41,188 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 19:50:41,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:50:41,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:50:41,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:50:41,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:50:41,420 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:50:41,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2025-04-13 19:50:42,701 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8750af45/19e6cadae9c748788320bab1c256e78e/FLAG5e614f070 [2025-04-13 19:50:42,909 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:50:42,910 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2025-04-13 19:50:42,918 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8750af45/19e6cadae9c748788320bab1c256e78e/FLAG5e614f070 [2025-04-13 19:50:43,751 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8750af45/19e6cadae9c748788320bab1c256e78e [2025-04-13 19:50:43,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:50:43,754 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:50:43,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:50:43,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:50:43,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:50:43,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:50:43" (1/1) ... [2025-04-13 19:50:43,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206a773b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:43, skipping insertion in model container [2025-04-13 19:50:43,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:50:43" (1/1) ... [2025-04-13 19:50:43,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:50:43,944 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/bench-exp3x3-opt.wvr.c[2904,2917] [2025-04-13 19:50:43,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:50:43,962 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:50:43,996 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/bench-exp3x3-opt.wvr.c[2904,2917] [2025-04-13 19:50:44,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:50:44,011 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:50:44,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44 WrapperNode [2025-04-13 19:50:44,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:50:44,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:50:44,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:50:44,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:50:44,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,044 INFO L138 Inliner]: procedures = 24, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-04-13 19:50:44,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:50:44,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:50:44,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:50:44,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:50:44,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:50:44,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:50:44,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:50:44,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:50:44,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:50:44,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (1/1) ... [2025-04-13 19:50:44,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:44,111 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 19:50:44,116 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 19:50:44,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:50:44,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-13 19:50:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:50:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:50:44,131 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 19:50:44,201 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:50:44,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:50:44,368 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:50:44,369 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:50:44,369 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:50:44,514 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:50:44,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:50:44 BoogieIcfgContainer [2025-04-13 19:50:44,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:50:44,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:50:44,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:50:44,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:50:44,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:50:43" (1/3) ... [2025-04-13 19:50:44,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ece1465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:50:44, skipping insertion in model container [2025-04-13 19:50:44,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:44" (2/3) ... [2025-04-13 19:50:44,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ece1465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:50:44, skipping insertion in model container [2025-04-13 19:50:44,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:50:44" (3/3) ... [2025-04-13 19:50:44,521 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-04-13 19:50:44,531 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:50:44,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 40 locations, 39 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 19:50:44,533 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:50:44,600 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-13 19:50:44,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 132 flow [2025-04-13 19:50:44,658 INFO L116 PetriNetUnfolderBase]: 6/39 cut-off events. [2025-04-13 19:50:44,660 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:50:44,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 39 events. 6/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-13 19:50:44,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 132 flow [2025-04-13 19:50:44,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 112 flow [2025-04-13 19:50:44,673 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:50:44,683 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;@35850a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:50:44,686 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:50:44,702 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:50:44,702 INFO L116 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-04-13 19:50:44,702 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:50:44,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:44,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:44,703 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 4 more)] === [2025-04-13 19:50:44,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1814207002, now seen corresponding path program 1 times [2025-04-13 19:50:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:44,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191247198] [2025-04-13 19:50:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:44,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 19:50:44,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:50:44,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:44,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:45,116 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 19:50:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:45,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191247198] [2025-04-13 19:50:45,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191247198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:45,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:50:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650006551] [2025-04-13 19:50:45,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:45,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:50:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:45,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:50:45,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:50:45,143 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:45,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:50:45,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:45,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:45,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:46,481 INFO L116 PetriNetUnfolderBase]: 21779/25316 cut-off events. [2025-04-13 19:50:46,482 INFO L117 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2025-04-13 19:50:46,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51771 conditions, 25316 events. 21779/25316 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 88392 event pairs, 3994 based on Foata normal form. 1/13860 useless extension candidates. Maximal degree in co-relation 44778. Up to 16365 conditions per place. [2025-04-13 19:50:46,637 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 49 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2025-04-13 19:50:46,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 281 flow [2025-04-13 19:50:46,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:50:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:50:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-04-13 19:50:46,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 19:50:46,647 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 112 flow. Second operand 3 states and 90 transitions. [2025-04-13 19:50:46,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 281 flow [2025-04-13 19:50:46,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-13 19:50:46,676 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2025-04-13 19:50:46,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-04-13 19:50:46,680 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2025-04-13 19:50:46,680 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2025-04-13 19:50:46,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:50:46,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:46,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:46,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:50:46,681 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 4 more)] === [2025-04-13 19:50:46,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 801268180, now seen corresponding path program 1 times [2025-04-13 19:50:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:46,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143635130] [2025-04-13 19:50:46,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:46,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 19:50:46,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:50:46,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:46,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:50:46,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:46,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143635130] [2025-04-13 19:50:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143635130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:50:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412120322] [2025-04-13 19:50:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:46,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:50:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:46,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:50:46,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:50:46,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:46,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 19:50:46,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:46,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:46,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:48,227 INFO L116 PetriNetUnfolderBase]: 28697/33440 cut-off events. [2025-04-13 19:50:48,227 INFO L117 PetriNetUnfolderBase]: For 4180/4180 co-relation queries the response was YES. [2025-04-13 19:50:48,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73082 conditions, 33440 events. 28697/33440 cut-off events. For 4180/4180 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 124467 event pairs, 4699 based on Foata normal form. 1/22696 useless extension candidates. Maximal degree in co-relation 23650. Up to 23701 conditions per place. [2025-04-13 19:50:48,355 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 57 selfloop transitions, 3 changer transitions 5/71 dead transitions. [2025-04-13 19:50:48,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 320 flow [2025-04-13 19:50:48,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:50:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:50:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-04-13 19:50:48,358 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2025-04-13 19:50:48,358 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 107 flow. Second operand 3 states and 98 transitions. [2025-04-13 19:50:48,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 320 flow [2025-04-13 19:50:48,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:48,363 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 123 flow [2025-04-13 19:50:48,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-04-13 19:50:48,363 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2025-04-13 19:50:48,363 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 123 flow [2025-04-13 19:50:48,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 19:50:48,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:48,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:48,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:50:48,364 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 4 more)] === [2025-04-13 19:50:48,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash 424184798, now seen corresponding path program 1 times [2025-04-13 19:50:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:48,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739801279] [2025-04-13 19:50:48,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:48,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 19:50:48,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 19:50:48,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:48,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:50:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:48,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739801279] [2025-04-13 19:50:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739801279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:50:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563661115] [2025-04-13 19:50:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:48,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:50:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:48,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:50:48,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:50:48,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:48,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:48,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:48,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:48,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:50,192 INFO L116 PetriNetUnfolderBase]: 36445/42857 cut-off events. [2025-04-13 19:50:50,192 INFO L117 PetriNetUnfolderBase]: For 12398/12398 co-relation queries the response was YES. [2025-04-13 19:50:50,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100205 conditions, 42857 events. 36445/42857 cut-off events. For 12398/12398 co-relation queries the response was YES. Maximal size of possible extension queue 1536. Compared 169260 event pairs, 5856 based on Foata normal form. 1/35667 useless extension candidates. Maximal degree in co-relation 41452. Up to 31148 conditions per place. [2025-04-13 19:50:50,327 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 59 selfloop transitions, 3 changer transitions 3/71 dead transitions. [2025-04-13 19:50:50,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 338 flow [2025-04-13 19:50:50,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:50:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:50:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-04-13 19:50:50,328 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6962962962962963 [2025-04-13 19:50:50,328 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 123 flow. Second operand 3 states and 94 transitions. [2025-04-13 19:50:50,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 338 flow [2025-04-13 19:50:50,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:50,330 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 139 flow [2025-04-13 19:50:50,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-04-13 19:50:50,331 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-04-13 19:50:50,331 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 139 flow [2025-04-13 19:50:50,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:50,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:50,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:50,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:50:50,331 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 4 more)] === [2025-04-13 19:50:50,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -203268553, now seen corresponding path program 1 times [2025-04-13 19:50:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:50,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760850502] [2025-04-13 19:50:50,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:50,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:50:50,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:50:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:50,437 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 19:50:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:50,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760850502] [2025-04-13 19:50:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760850502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:50,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979930525] [2025-04-13 19:50:50,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:50,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:50,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:50,441 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 19:50:50,442 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 19:50:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:50:50,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:50:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:50,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:50,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:50,590 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 19:50:50,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:50,637 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 19:50:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979930525] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:50,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-04-13 19:50:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093141755] [2025-04-13 19:50:50,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:50,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:50:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:50,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:50:50,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:50:50,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:50,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 19:50:50,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:50,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:52,229 INFO L116 PetriNetUnfolderBase]: 41073/48676 cut-off events. [2025-04-13 19:50:52,229 INFO L117 PetriNetUnfolderBase]: For 18456/18456 co-relation queries the response was YES. [2025-04-13 19:50:52,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122494 conditions, 48676 events. 41073/48676 cut-off events. For 18456/18456 co-relation queries the response was YES. Maximal size of possible extension queue 1781. Compared 204723 event pairs, 6124 based on Foata normal form. 981/49431 useless extension candidates. Maximal degree in co-relation 40746. Up to 22914 conditions per place. [2025-04-13 19:50:52,408 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 106 selfloop transitions, 6 changer transitions 11/129 dead transitions. [2025-04-13 19:50:52,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 129 transitions, 641 flow [2025-04-13 19:50:52,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-04-13 19:50:52,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2025-04-13 19:50:52,410 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 139 flow. Second operand 5 states and 170 transitions. [2025-04-13 19:50:52,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 129 transitions, 641 flow [2025-04-13 19:50:52,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 129 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:52,418 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 173 flow [2025-04-13 19:50:52,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-04-13 19:50:52,419 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2025-04-13 19:50:52,419 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 173 flow [2025-04-13 19:50:52,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 19:50:52,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:52,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:52,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:50:52,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:52,623 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 4 more)] === [2025-04-13 19:50:52,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 348619727, now seen corresponding path program 1 times [2025-04-13 19:50:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:52,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305548391] [2025-04-13 19:50:52,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:50:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:50:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:50:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:52,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305548391] [2025-04-13 19:50:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305548391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:52,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:52,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583933171] [2025-04-13 19:50:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:52,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:52,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:52,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:52,714 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:52,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:52,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:52,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:52,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:54,979 INFO L116 PetriNetUnfolderBase]: 40803/48294 cut-off events. [2025-04-13 19:50:54,979 INFO L117 PetriNetUnfolderBase]: For 30028/30028 co-relation queries the response was YES. [2025-04-13 19:50:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132576 conditions, 48294 events. 40803/48294 cut-off events. For 30028/30028 co-relation queries the response was YES. Maximal size of possible extension queue 1735. Compared 201727 event pairs, 973 based on Foata normal form. 562/48798 useless extension candidates. Maximal degree in co-relation 51811. Up to 18355 conditions per place. [2025-04-13 19:50:55,120 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 84 selfloop transitions, 4 changer transitions 35/129 dead transitions. [2025-04-13 19:50:55,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 129 transitions, 677 flow [2025-04-13 19:50:55,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-04-13 19:50:55,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7288888888888889 [2025-04-13 19:50:55,121 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 173 flow. Second operand 5 states and 164 transitions. [2025-04-13 19:50:55,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 129 transitions, 677 flow [2025-04-13 19:50:55,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 129 transitions, 671 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:55,284 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 181 flow [2025-04-13 19:50:55,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-04-13 19:50:55,284 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2025-04-13 19:50:55,284 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 181 flow [2025-04-13 19:50:55,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:55,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:55,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:55,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:50:55,285 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 4 more)] === [2025-04-13 19:50:55,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash 699492777, now seen corresponding path program 2 times [2025-04-13 19:50:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:55,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995574959] [2025-04-13 19:50:55,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:55,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 19:50:55,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:50:55,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:55,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:55,367 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 19:50:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:55,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995574959] [2025-04-13 19:50:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995574959] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:55,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213305182] [2025-04-13 19:50:55,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:55,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:55,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:55,370 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 19:50:55,371 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 19:50:55,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 19:50:55,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:50:55,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:55,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:55,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:55,528 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 19:50:55,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:55,595 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 19:50:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213305182] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:55,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:55,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:50:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476257237] [2025-04-13 19:50:55,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:55,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:50:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:55,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:50:55,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:50:55,596 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:55,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 19:50:55,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:55,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:57,222 INFO L116 PetriNetUnfolderBase]: 30856/36813 cut-off events. [2025-04-13 19:50:57,222 INFO L117 PetriNetUnfolderBase]: For 42659/42659 co-relation queries the response was YES. [2025-04-13 19:50:57,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110197 conditions, 36813 events. 30856/36813 cut-off events. For 42659/42659 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 148672 event pairs, 1462 based on Foata normal form. 1450/38140 useless extension candidates. Maximal degree in co-relation 56975. Up to 6873 conditions per place. [2025-04-13 19:50:57,372 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 304 selfloop transitions, 41 changer transitions 30/381 dead transitions. [2025-04-13 19:50:57,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 381 transitions, 2394 flow [2025-04-13 19:50:57,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:50:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 19:50:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 518 transitions. [2025-04-13 19:50:57,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.677124183006536 [2025-04-13 19:50:57,374 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 181 flow. Second operand 17 states and 518 transitions. [2025-04-13 19:50:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 381 transitions, 2394 flow [2025-04-13 19:50:57,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 381 transitions, 2357 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:57,386 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 538 flow [2025-04-13 19:50:57,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=538, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2025-04-13 19:50:57,387 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-04-13 19:50:57,387 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 538 flow [2025-04-13 19:50:57,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 19:50:57,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:57,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:57,393 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 19:50:57,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 19:50:57,592 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 4 more)] === [2025-04-13 19:50:57,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 930583627, now seen corresponding path program 1 times [2025-04-13 19:50:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:57,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37532138] [2025-04-13 19:50:57,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:57,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:50:57,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:50:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:50:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:57,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37532138] [2025-04-13 19:50:57,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37532138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:57,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:57,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323392463] [2025-04-13 19:50:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:57,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:57,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:57,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:57,659 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:50:57,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 538 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:57,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:57,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:50:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:59,733 INFO L116 PetriNetUnfolderBase]: 30444/36320 cut-off events. [2025-04-13 19:50:59,733 INFO L117 PetriNetUnfolderBase]: For 160919/160919 co-relation queries the response was YES. [2025-04-13 19:50:59,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168006 conditions, 36320 events. 30444/36320 cut-off events. For 160919/160919 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 147964 event pairs, 989 based on Foata normal form. 412/36681 useless extension candidates. Maximal degree in co-relation 93135. Up to 14267 conditions per place. [2025-04-13 19:50:59,963 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 122 selfloop transitions, 10 changer transitions 55/193 dead transitions. [2025-04-13 19:50:59,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 193 transitions, 1548 flow [2025-04-13 19:50:59,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-04-13 19:50:59,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-04-13 19:50:59,965 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 538 flow. Second operand 5 states and 156 transitions. [2025-04-13 19:50:59,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 193 transitions, 1548 flow [2025-04-13 19:51:00,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 193 transitions, 1494 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-04-13 19:51:00,854 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 535 flow [2025-04-13 19:51:00,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=535, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2025-04-13 19:51:00,854 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2025-04-13 19:51:00,854 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 535 flow [2025-04-13 19:51:00,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:51:00,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:51:00,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:51:00,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:51:00,855 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 4 more)] === [2025-04-13 19:51:00,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:51:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1642121915, now seen corresponding path program 2 times [2025-04-13 19:51:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:51:00,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372536389] [2025-04-13 19:51:00,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:51:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:51:00,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 19:51:00,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:51:00,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:51:00,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:00,927 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 19:51:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:51:00,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372536389] [2025-04-13 19:51:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372536389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:51:00,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234719862] [2025-04-13 19:51:00,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:51:00,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:51:00,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:51:00,929 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 19:51:00,935 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 19:51:00,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 19:51:00,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:51:00,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:51:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:51:00,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:01,028 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 19:51:01,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:01,066 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 19:51:01,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234719862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:01,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-04-13 19:51:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463120032] [2025-04-13 19:51:01,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:01,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:51:01,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:01,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:51:01,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:51:01,069 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:51:01,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 19:51:01,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:01,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:51:01,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:02,129 INFO L116 PetriNetUnfolderBase]: 19916/23680 cut-off events. [2025-04-13 19:51:02,130 INFO L117 PetriNetUnfolderBase]: For 153138/153138 co-relation queries the response was YES. [2025-04-13 19:51:02,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112439 conditions, 23680 events. 19916/23680 cut-off events. For 153138/153138 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 93016 event pairs, 735 based on Foata normal form. 700/24366 useless extension candidates. Maximal degree in co-relation 64674. Up to 17892 conditions per place. [2025-04-13 19:51:02,283 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 272 selfloop transitions, 6 changer transitions 0/284 dead transitions. [2025-04-13 19:51:02,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 284 transitions, 2360 flow [2025-04-13 19:51:02,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:51:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:51:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-04-13 19:51:02,284 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-04-13 19:51:02,285 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 535 flow. Second operand 5 states and 153 transitions. [2025-04-13 19:51:02,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 284 transitions, 2360 flow [2025-04-13 19:51:02,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 284 transitions, 2321 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:51:02,398 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 561 flow [2025-04-13 19:51:02,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=88, PETRI_TRANSITIONS=92} [2025-04-13 19:51:02,398 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2025-04-13 19:51:02,398 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 561 flow [2025-04-13 19:51:02,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 19:51:02,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:51:02,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:51:02,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:51:02,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:51:02,603 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 4 more)] === [2025-04-13 19:51:02,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:51:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash 33404947, now seen corresponding path program 1 times [2025-04-13 19:51:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:51:02,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126475254] [2025-04-13 19:51:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:51:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:51:02,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:51:02,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:51:02,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:51:02,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:51:02,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:51:02,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126475254] [2025-04-13 19:51:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126475254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:51:02,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:51:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:51:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315126215] [2025-04-13 19:51:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:51:02,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:51:02,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:02,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:51:02,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:51:02,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:51:02,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 19:51:02,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:02,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:51:02,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:03,730 INFO L116 PetriNetUnfolderBase]: 19713/23588 cut-off events. [2025-04-13 19:51:03,730 INFO L117 PetriNetUnfolderBase]: For 135863/135863 co-relation queries the response was YES. [2025-04-13 19:51:03,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117773 conditions, 23588 events. 19713/23588 cut-off events. For 135863/135863 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 89359 event pairs, 998 based on Foata normal form. 203/23676 useless extension candidates. Maximal degree in co-relation 101556. Up to 9384 conditions per place. [2025-04-13 19:51:03,879 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 127 selfloop transitions, 10 changer transitions 54/197 dead transitions. [2025-04-13 19:51:03,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 197 transitions, 1686 flow [2025-04-13 19:51:03,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:51:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:51:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-04-13 19:51:03,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6577777777777778 [2025-04-13 19:51:03,880 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 561 flow. Second operand 5 states and 148 transitions. [2025-04-13 19:51:03,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 197 transitions, 1686 flow [2025-04-13 19:51:04,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 197 transitions, 1653 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-13 19:51:04,236 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 583 flow [2025-04-13 19:51:04,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=583, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-04-13 19:51:04,237 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2025-04-13 19:51:04,237 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 583 flow [2025-04-13 19:51:04,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 19:51:04,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:51:04,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:51:04,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:51:04,237 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 4 more)] === [2025-04-13 19:51:04,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:51:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash 514430081, now seen corresponding path program 2 times [2025-04-13 19:51:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:51:04,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675080616] [2025-04-13 19:51:04,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:51:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:51:04,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 19:51:04,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:51:04,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:51:04,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:51:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:51:04,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675080616] [2025-04-13 19:51:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675080616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:51:04,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917595561] [2025-04-13 19:51:04,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:51:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:51:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:51:04,312 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 19:51:04,314 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 19:51:04,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 19:51:04,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:51:04,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:51:04,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:04,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:51:04,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:51:04,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:51:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917595561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:04,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:04,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-04-13 19:51:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529411205] [2025-04-13 19:51:04,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:04,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:51:04,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:04,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:51:04,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:51:04,540 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:51:04,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 19:51:04,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:04,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:51:04,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:05,627 INFO L116 PetriNetUnfolderBase]: 13483/16181 cut-off events. [2025-04-13 19:51:05,627 INFO L117 PetriNetUnfolderBase]: For 93121/93121 co-relation queries the response was YES. [2025-04-13 19:51:05,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80217 conditions, 16181 events. 13483/16181 cut-off events. For 93121/93121 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 58351 event pairs, 999 based on Foata normal form. 404/16515 useless extension candidates. Maximal degree in co-relation 69719. Up to 10707 conditions per place. [2025-04-13 19:51:05,720 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 155 selfloop transitions, 12 changer transitions 0/173 dead transitions. [2025-04-13 19:51:05,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 173 transitions, 1466 flow [2025-04-13 19:51:05,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:51:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:51:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-04-13 19:51:05,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2025-04-13 19:51:05,721 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 583 flow. Second operand 5 states and 141 transitions. [2025-04-13 19:51:05,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 173 transitions, 1466 flow [2025-04-13 19:51:05,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 173 transitions, 1453 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:51:05,913 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 638 flow [2025-04-13 19:51:05,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=638, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2025-04-13 19:51:05,913 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2025-04-13 19:51:05,913 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 638 flow [2025-04-13 19:51:05,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 19:51:05,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:51:05,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:51:05,920 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 19:51:06,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:51:06,114 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 4 more)] === [2025-04-13 19:51:06,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:51:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1064326143, now seen corresponding path program 1 times [2025-04-13 19:51:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:51:06,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907256714] [2025-04-13 19:51:06,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:51:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:51:06,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:51:06,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:51:06,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:51:06,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:51:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:51:06,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907256714] [2025-04-13 19:51:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907256714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:51:06,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185574646] [2025-04-13 19:51:06,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:51:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:51:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:51:06,192 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 19:51:06,193 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 19:51:06,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:51:06,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:51:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:51:06,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:06,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:51:06,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:51:06,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:51:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185574646] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:06,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-04-13 19:51:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20490193] [2025-04-13 19:51:06,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:06,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:51:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:06,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:51:06,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:51:06,359 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:51:06,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 638 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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 19:51:06,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:06,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:51:06,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:07,128 INFO L116 PetriNetUnfolderBase]: 12943/15535 cut-off events. [2025-04-13 19:51:07,129 INFO L117 PetriNetUnfolderBase]: For 94578/94578 co-relation queries the response was YES. [2025-04-13 19:51:07,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80091 conditions, 15535 events. 12943/15535 cut-off events. For 94578/94578 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 55769 event pairs, 862 based on Foata normal form. 540/16050 useless extension candidates. Maximal degree in co-relation 69624. Up to 11160 conditions per place. [2025-04-13 19:51:07,236 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 173 selfloop transitions, 12 changer transitions 0/191 dead transitions. [2025-04-13 19:51:07,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 191 transitions, 1717 flow [2025-04-13 19:51:07,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:51:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:51:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-04-13 19:51:07,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-04-13 19:51:07,237 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 638 flow. Second operand 5 states and 147 transitions. [2025-04-13 19:51:07,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 191 transitions, 1717 flow [2025-04-13 19:51:07,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 191 transitions, 1664 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-04-13 19:51:07,673 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 687 flow [2025-04-13 19:51:07,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2025-04-13 19:51:07,673 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2025-04-13 19:51:07,674 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 687 flow [2025-04-13 19:51:07,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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 19:51:07,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:51:07,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:51:07,680 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 19:51:07,874 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,SelfDestructingSolverStorable10 [2025-04-13 19:51:07,874 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 4 more)] === [2025-04-13 19:51:07,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:51:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2098842563, now seen corresponding path program 1 times [2025-04-13 19:51:07,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:51:07,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899611881] [2025-04-13 19:51:07,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:51:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:51:07,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:51:07,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:51:07,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:51:07,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:51:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:51:08,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899611881] [2025-04-13 19:51:08,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899611881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:51:08,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770896880] [2025-04-13 19:51:08,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:51:08,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:51:08,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:51:08,228 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 19:51:08,229 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 19:51:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:51:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:51:08,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:51:08,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:51:08,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:51:08,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:51:26,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:51:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770896880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:27,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:27,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 13 [2025-04-13 19:51:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178007726] [2025-04-13 19:51:27,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:27,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:51:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:27,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:51:27,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=160, Unknown=1, NotChecked=0, Total=210 [2025-04-13 19:51:27,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:51:27,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 687 flow. Second operand has 15 states, 15 states have (on average 18.4) internal successors, (276), 15 states have internal predecessors, (276), 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 19:51:27,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:27,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:51:27,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:47,663 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:51,678 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:55,916 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:59,927 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:25,426 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:29,435 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:32,654 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:35,315 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:37,574 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:43,444 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:46,057 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:53,558 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:57,962 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:58,036 INFO L116 PetriNetUnfolderBase]: 93744/112837 cut-off events. [2025-04-13 19:52:58,037 INFO L117 PetriNetUnfolderBase]: For 940917/940917 co-relation queries the response was YES. [2025-04-13 19:52:59,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617136 conditions, 112837 events. 93744/112837 cut-off events. For 940917/940917 co-relation queries the response was YES. Maximal size of possible extension queue 3652. Compared 528908 event pairs, 623 based on Foata normal form. 963/113796 useless extension candidates. Maximal degree in co-relation 490996. Up to 22751 conditions per place. [2025-04-13 19:52:59,445 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 1422 selfloop transitions, 715 changer transitions 394/2537 dead transitions. [2025-04-13 19:52:59,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 2537 transitions, 25205 flow [2025-04-13 19:52:59,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 19:52:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-04-13 19:52:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 1953 transitions. [2025-04-13 19:52:59,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6027777777777777 [2025-04-13 19:52:59,452 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 687 flow. Second operand 72 states and 1953 transitions. [2025-04-13 19:52:59,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 2537 transitions, 25205 flow [2025-04-13 19:53:13,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 2537 transitions, 24332 flow, removed 325 selfloop flow, removed 1 redundant places. [2025-04-13 19:53:13,509 INFO L231 Difference]: Finished difference. Result has 239 places, 861 transitions, 9399 flow [2025-04-13 19:53:13,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=9399, PETRI_PLACES=239, PETRI_TRANSITIONS=861} [2025-04-13 19:53:13,510 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 188 predicate places. [2025-04-13 19:53:13,510 INFO L485 AbstractCegarLoop]: Abstraction has has 239 places, 861 transitions, 9399 flow [2025-04-13 19:53:13,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.4) internal successors, (276), 15 states have internal predecessors, (276), 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 19:53:13,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:13,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:13,517 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 19:53:13,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:13,711 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 4 more)] === [2025-04-13 19:53:13,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1623295565, now seen corresponding path program 2 times [2025-04-13 19:53:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:13,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095692376] [2025-04-13 19:53:13,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:13,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 19:53:13,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:53:13,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:53:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:13,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095692376] [2025-04-13 19:53:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095692376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:13,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548469436] [2025-04-13 19:53:13,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:53:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:13,975 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 19:53:13,977 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 19:53:14,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 19:53:14,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:53:14,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:53:14,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:14,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:53:14,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:53:22,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 19:53:27,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548469436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:53:27,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:53:27,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 11 [2025-04-13 19:53:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785928397] [2025-04-13 19:53:27,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:53:27,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:53:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:27,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:53:27,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=119, Unknown=1, NotChecked=0, Total=156 [2025-04-13 19:53:27,017 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-04-13 19:53:27,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 861 transitions, 9399 flow. Second operand has 13 states, 13 states have (on average 19.384615384615383) internal successors, (252), 13 states have internal predecessors, (252), 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 19:53:27,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:27,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-04-13 19:53:27,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:37,790 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 37 DAG size of output: 28 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:53:45,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:47,184 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:13,950 WARN L286 SmtUtils]: Spent 23.09s on a formula simplification. DAG size of input: 53 DAG size of output: 53 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:54:18,181 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:20,066 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:58,176 WARN L286 SmtUtils]: Spent 38.01s on a formula simplification. DAG size of input: 42 DAG size of output: 42 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:55:00,780 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:19,811 WARN L286 SmtUtils]: Spent 11.44s on a formula simplification. DAG size of input: 56 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:55:53,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:06,731 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:08,665 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:29,623 WARN L286 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:56:37,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:45,093 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:46,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:48,891 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:09,460 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:57:11,251 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:28,448 WARN L286 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 37 DAG size of output: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:57:31,124 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:32,768 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:34,027 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:52,804 WARN L286 SmtUtils]: Spent 15.21s on a formula simplification. DAG size of input: 61 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:57:56,808 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:00,388 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:02,546 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:21,184 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:25,216 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:43,007 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:44,657 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:48,681 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:57,735 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:59,353 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:00,881 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:13,122 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:15,040 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:38,594 WARN L286 SmtUtils]: Spent 18.35s on a formula simplification. DAG size of input: 46 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:59:42,704 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:46,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:59:59,110 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:00,295 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:02,473 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:06,517 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:10,608 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:11,864 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:14,713 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:18,724 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:20,492 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:26,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:27,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:29,966 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:31,813 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:35,942 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:40,404 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:41,600 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:43,855 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:47,492 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:50,676 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:56,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:01:05,527 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:01:15,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:01:25,447 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:01:39,438 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []