/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-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:50:35,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:50:35,637 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:35,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:50:35,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:50:35,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:50:35,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:50:35,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:50:35,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:50:35,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:50:35,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:50:35,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:50:35,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:50:35,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:50:35,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:50:35,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:50:35,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:35,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:50:35,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:35,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:50:35,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:50:35,668 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:35,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:50:35,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:50:35,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:50:35,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:50:35,883 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:50:35,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2025-04-13 19:50:37,189 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9078632ab/dfb9ccfc789e43d8b50bae7fb1a4ebba/FLAGdad0a6bf4 [2025-04-13 19:50:37,382 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:50:37,382 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2025-04-13 19:50:37,391 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9078632ab/dfb9ccfc789e43d8b50bae7fb1a4ebba/FLAGdad0a6bf4 [2025-04-13 19:50:38,189 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9078632ab/dfb9ccfc789e43d8b50bae7fb1a4ebba [2025-04-13 19:50:38,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:50:38,193 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:50:38,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:50:38,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:50:38,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:50:38,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:50:38" (1/1) ... [2025-04-13 19:50:38,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161a448b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:38, skipping insertion in model container [2025-04-13 19:50:38,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:50:38" (1/1) ... [2025-04-13 19:50:38,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:50:38,381 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-exp2x9.wvr.c[2721,2734] [2025-04-13 19:50:38,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:50:38,401 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:50:38,436 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-exp2x9.wvr.c[2721,2734] [2025-04-13 19:50:38,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:50:38,450 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:50:38,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:38 WrapperNode [2025-04-13 19:50:38,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:50:38,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:50:38,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:50:38,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:50:38,458 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:38" (1/1) ... [2025-04-13 19:50:38,466 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:38" (1/1) ... [2025-04-13 19:50:38,485 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-13 19:50:38,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:50:38,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:50:38,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:50:38,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:50:38,493 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:38" (1/1) ... [2025-04-13 19:50:38,493 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:38" (1/1) ... [2025-04-13 19:50:38,495 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:38" (1/1) ... [2025-04-13 19:50:38,510 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:38,510 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:38" (1/1) ... [2025-04-13 19:50:38,510 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:38" (1/1) ... [2025-04-13 19:50:38,515 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:38" (1/1) ... [2025-04-13 19:50:38,516 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:38" (1/1) ... [2025-04-13 19:50:38,521 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:38" (1/1) ... [2025-04-13 19:50:38,521 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:38" (1/1) ... [2025-04-13 19:50:38,522 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:38" (1/1) ... [2025-04-13 19:50:38,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:50:38,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:50:38,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:50:38,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:50:38,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:38" (1/1) ... [2025-04-13 19:50:38,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:50:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:38,563 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:38,565 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:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:50:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:50:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:50:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:50:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:50:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:50:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:50:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 19:50:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 19:50:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:50:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:50:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:50:38,583 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:38,659 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:50:38,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:50:38,840 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:50:38,840 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:50:38,840 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:50:39,013 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:50:39,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:50:39 BoogieIcfgContainer [2025-04-13 19:50:39,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:50:39,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:50:39,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:50:39,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:50:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:50:38" (1/3) ... [2025-04-13 19:50:39,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c3cb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:50:39, skipping insertion in model container [2025-04-13 19:50:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:50:38" (2/3) ... [2025-04-13 19:50:39,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c3cb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:50:39, skipping insertion in model container [2025-04-13 19:50:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:50:39" (3/3) ... [2025-04-13 19:50:39,020 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-04-13 19:50:39,030 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:50:39,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 19:50:39,033 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:50:39,085 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:50:39,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:50:39,137 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-13 19:50:39,141 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:50:39,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-13 19:50:39,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 19:50:39,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-13 19:50:39,155 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:50:39,166 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;@76ada956, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:50:39,166 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:50:39,175 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:50:39,175 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-13 19:50:39,175 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:50:39,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:39,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:39,176 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 2 more)] === [2025-04-13 19:50:39,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1647812737, now seen corresponding path program 1 times [2025-04-13 19:50:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:39,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750173725] [2025-04-13 19:50:39,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:39,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:50:39,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:50:39,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:39,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:39,575 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:39,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:39,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750173725] [2025-04-13 19:50:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750173725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:50:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182997778] [2025-04-13 19:50:39,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:39,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:50:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:39,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:50:39,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:50:39,607 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:39,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:39,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:39,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:39,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:39,827 INFO L116 PetriNetUnfolderBase]: 1367/1731 cut-off events. [2025-04-13 19:50:39,827 INFO L117 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-04-13 19:50:39,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1731 events. 1367/1731 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5567 event pairs, 123 based on Foata normal form. 1/1000 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-04-13 19:50:39,843 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2025-04-13 19:50:39,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2025-04-13 19:50:39,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:50:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:50:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 19:50:39,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 19:50:39,853 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 76 flow. Second operand 3 states and 66 transitions. [2025-04-13 19:50:39,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2025-04-13 19:50:39,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 19:50:39,859 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 93 flow [2025-04-13 19:50:39,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2025-04-13 19:50:39,863 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-13 19:50:39,863 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 93 flow [2025-04-13 19:50:39,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:50:39,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:39,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:39,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:50:39,863 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 2 more)] === [2025-04-13 19:50:39,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -142278351, now seen corresponding path program 1 times [2025-04-13 19:50:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:39,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165266205] [2025-04-13 19:50:39,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:39,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:39,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:39,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:39,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:39,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:39,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165266205] [2025-04-13 19:50:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165266205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:39,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:39,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716654001] [2025-04-13 19:50:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:39,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:39,992 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:39,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:39,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:39,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:39,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:40,241 INFO L116 PetriNetUnfolderBase]: 1560/2015 cut-off events. [2025-04-13 19:50:40,242 INFO L117 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2025-04-13 19:50:40,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4995 conditions, 2015 events. 1560/2015 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6904 event pairs, 89 based on Foata normal form. 33/2044 useless extension candidates. Maximal degree in co-relation 1787. Up to 826 conditions per place. [2025-04-13 19:50:40,259 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 57 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-04-13 19:50:40,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 351 flow [2025-04-13 19:50:40,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 19:50:40,260 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-13 19:50:40,261 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 93 flow. Second operand 5 states and 101 transitions. [2025-04-13 19:50:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 351 flow [2025-04-13 19:50:40,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 71 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:40,262 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 153 flow [2025-04-13 19:50:40,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-13 19:50:40,263 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-13 19:50:40,263 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 153 flow [2025-04-13 19:50:40,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:40,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:40,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:40,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:50:40,263 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 2 more)] === [2025-04-13 19:50:40,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1292081630, now seen corresponding path program 1 times [2025-04-13 19:50:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:40,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340284178] [2025-04-13 19:50:40,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:40,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:40,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:40,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:40,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:40,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340284178] [2025-04-13 19:50:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340284178] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:40,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095096754] [2025-04-13 19:50:40,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:40,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:40,356 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:40,357 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:40,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:40,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:40,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:40,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:40,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:40,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:40,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095096754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:40,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172029364] [2025-04-13 19:50:40,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:40,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:40,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:40,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:40,581 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:40,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:40,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:40,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:40,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:40,853 INFO L116 PetriNetUnfolderBase]: 1955/2589 cut-off events. [2025-04-13 19:50:40,853 INFO L117 PetriNetUnfolderBase]: For 2885/2893 co-relation queries the response was YES. [2025-04-13 19:50:40,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 2589 events. 1955/2589 cut-off events. For 2885/2893 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10502 event pairs, 325 based on Foata normal form. 80/2659 useless extension candidates. Maximal degree in co-relation 4051. Up to 1294 conditions per place. [2025-04-13 19:50:40,870 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 89 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-04-13 19:50:40,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 101 transitions, 613 flow [2025-04-13 19:50:40,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-04-13 19:50:40,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7290322580645161 [2025-04-13 19:50:40,873 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 153 flow. Second operand 5 states and 113 transitions. [2025-04-13 19:50:40,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 101 transitions, 613 flow [2025-04-13 19:50:40,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 101 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:50:40,879 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 208 flow [2025-04-13 19:50:40,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-13 19:50:40,880 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-04-13 19:50:40,880 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 208 flow [2025-04-13 19:50:40,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:40,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:40,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:40,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:50:41,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:41,086 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 2 more)] === [2025-04-13 19:50:41,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -278380819, now seen corresponding path program 1 times [2025-04-13 19:50:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:41,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597875553] [2025-04-13 19:50:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:41,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:41,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:41,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:41,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597875553] [2025-04-13 19:50:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597875553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:41,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86739441] [2025-04-13 19:50:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:41,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:41,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:41,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:41,152 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:41,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:41,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:41,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:41,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:41,465 INFO L116 PetriNetUnfolderBase]: 1925/2549 cut-off events. [2025-04-13 19:50:41,465 INFO L117 PetriNetUnfolderBase]: For 4641/4643 co-relation queries the response was YES. [2025-04-13 19:50:41,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9408 conditions, 2549 events. 1925/2549 cut-off events. For 4641/4643 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10171 event pairs, 162 based on Foata normal form. 46/2591 useless extension candidates. Maximal degree in co-relation 4950. Up to 1049 conditions per place. [2025-04-13 19:50:41,485 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 89 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-04-13 19:50:41,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 103 transitions, 685 flow [2025-04-13 19:50:41,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 19:50:41,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-13 19:50:41,488 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 208 flow. Second operand 5 states and 109 transitions. [2025-04-13 19:50:41,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 103 transitions, 685 flow [2025-04-13 19:50:41,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 103 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:50:41,498 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 271 flow [2025-04-13 19:50:41,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-13 19:50:41,498 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-04-13 19:50:41,498 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 271 flow [2025-04-13 19:50:41,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:41,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:41,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:41,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:50:41,499 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 2 more)] === [2025-04-13 19:50:41,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1168027282, now seen corresponding path program 1 times [2025-04-13 19:50:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:41,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720272650] [2025-04-13 19:50:41,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:41,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:41,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:41,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:41,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:41,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720272650] [2025-04-13 19:50:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720272650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:41,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659313558] [2025-04-13 19:50:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:41,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:41,585 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:41,586 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:41,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:50:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:41,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:41,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:41,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659313558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:41,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415429150] [2025-04-13 19:50:41,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:41,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:41,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:41,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:41,808 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:41,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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:41,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:41,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:41,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:42,083 INFO L116 PetriNetUnfolderBase]: 2018/2760 cut-off events. [2025-04-13 19:50:42,083 INFO L117 PetriNetUnfolderBase]: For 5917/5917 co-relation queries the response was YES. [2025-04-13 19:50:42,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10840 conditions, 2760 events. 2018/2760 cut-off events. For 5917/5917 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11903 event pairs, 337 based on Foata normal form. 77/2831 useless extension candidates. Maximal degree in co-relation 4771. Up to 1153 conditions per place. [2025-04-13 19:50:42,104 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 93 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2025-04-13 19:50:42,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 107 transitions, 835 flow [2025-04-13 19:50:42,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-13 19:50:42,105 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2025-04-13 19:50:42,105 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 271 flow. Second operand 5 states and 103 transitions. [2025-04-13 19:50:42,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 107 transitions, 835 flow [2025-04-13 19:50:42,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 790 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:42,111 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 312 flow [2025-04-13 19:50:42,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-04-13 19:50:42,112 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-13 19:50:42,112 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 312 flow [2025-04-13 19:50:42,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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:42,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:42,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:42,118 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:42,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:42,313 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 2 more)] === [2025-04-13 19:50:42,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1524242342, now seen corresponding path program 2 times [2025-04-13 19:50:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:42,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765201049] [2025-04-13 19:50:42,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:42,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:42,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:42,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:42,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:42,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765201049] [2025-04-13 19:50:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765201049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:42,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668987898] [2025-04-13 19:50:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:42,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:42,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:42,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:42,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:42,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:42,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:42,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:42,614 INFO L116 PetriNetUnfolderBase]: 1819/2464 cut-off events. [2025-04-13 19:50:42,614 INFO L117 PetriNetUnfolderBase]: For 5922/5922 co-relation queries the response was YES. [2025-04-13 19:50:42,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10460 conditions, 2464 events. 1819/2464 cut-off events. For 5922/5922 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9896 event pairs, 108 based on Foata normal form. 37/2495 useless extension candidates. Maximal degree in co-relation 7041. Up to 1016 conditions per place. [2025-04-13 19:50:42,633 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 90 selfloop transitions, 9 changer transitions 2/105 dead transitions. [2025-04-13 19:50:42,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 105 transitions, 809 flow [2025-04-13 19:50:42,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 19:50:42,634 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2025-04-13 19:50:42,634 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 312 flow. Second operand 5 states and 101 transitions. [2025-04-13 19:50:42,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 105 transitions, 809 flow [2025-04-13 19:50:42,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 800 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:42,644 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 316 flow [2025-04-13 19:50:42,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-04-13 19:50:42,645 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-13 19:50:42,645 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 316 flow [2025-04-13 19:50:42,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:42,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:42,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:42,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:50:42,646 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 2 more)] === [2025-04-13 19:50:42,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1730050889, now seen corresponding path program 2 times [2025-04-13 19:50:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:42,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511135742] [2025-04-13 19:50:42,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:42,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:42,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:42,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:42,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:42,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511135742] [2025-04-13 19:50:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511135742] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:42,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639768135] [2025-04-13 19:50:42,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:42,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:42,718 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:50:42,721 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:50:42,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:42,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:42,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:42,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:42,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:42,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639768135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:42,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611344450] [2025-04-13 19:50:42,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:42,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:42,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:42,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:42,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:42,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:42,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:42,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:42,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:43,222 INFO L116 PetriNetUnfolderBase]: 1745/2404 cut-off events. [2025-04-13 19:50:43,223 INFO L117 PetriNetUnfolderBase]: For 6232/6232 co-relation queries the response was YES. [2025-04-13 19:50:43,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10619 conditions, 2404 events. 1745/2404 cut-off events. For 6232/6232 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10222 event pairs, 303 based on Foata normal form. 74/2472 useless extension candidates. Maximal degree in co-relation 6671. Up to 1314 conditions per place. [2025-04-13 19:50:43,234 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2025-04-13 19:50:43,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 103 transitions, 829 flow [2025-04-13 19:50:43,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-13 19:50:43,236 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.632258064516129 [2025-04-13 19:50:43,237 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 316 flow. Second operand 5 states and 98 transitions. [2025-04-13 19:50:43,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 103 transitions, 829 flow [2025-04-13 19:50:43,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:43,241 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 363 flow [2025-04-13 19:50:43,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-04-13 19:50:43,242 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-04-13 19:50:43,242 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 363 flow [2025-04-13 19:50:43,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:43,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:43,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:43,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:50:43,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:43,443 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 2 more)] === [2025-04-13 19:50:43,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash 730400568, now seen corresponding path program 2 times [2025-04-13 19:50:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:43,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423797812] [2025-04-13 19:50:43,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:43,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:43,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:43,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:43,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:43,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423797812] [2025-04-13 19:50:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423797812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:50:43,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:50:43,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:50:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766692586] [2025-04-13 19:50:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:50:43,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:50:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:43,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:50:43,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:50:43,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:43,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:43,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:43,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:43,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:43,701 INFO L116 PetriNetUnfolderBase]: 1515/2039 cut-off events. [2025-04-13 19:50:43,701 INFO L117 PetriNetUnfolderBase]: For 7816/7821 co-relation queries the response was YES. [2025-04-13 19:50:43,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9682 conditions, 2039 events. 1515/2039 cut-off events. For 7816/7821 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8076 event pairs, 89 based on Foata normal form. 35/2072 useless extension candidates. Maximal degree in co-relation 8463. Up to 864 conditions per place. [2025-04-13 19:50:43,713 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 108 selfloop transitions, 9 changer transitions 4/125 dead transitions. [2025-04-13 19:50:43,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1122 flow [2025-04-13 19:50:43,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 19:50:43,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032258064516129 [2025-04-13 19:50:43,715 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 363 flow. Second operand 5 states and 109 transitions. [2025-04-13 19:50:43,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1122 flow [2025-04-13 19:50:43,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 1081 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:43,722 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 365 flow [2025-04-13 19:50:43,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-04-13 19:50:43,727 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-04-13 19:50:43,727 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 365 flow [2025-04-13 19:50:43,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:43,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:43,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:43,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:50:43,727 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 2 more)] === [2025-04-13 19:50:43,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash -519379057, now seen corresponding path program 2 times [2025-04-13 19:50:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:43,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013485675] [2025-04-13 19:50:43,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:43,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:43,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:43,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:43,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:43,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:43,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013485675] [2025-04-13 19:50:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013485675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:43,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493198668] [2025-04-13 19:50:43,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:50:43,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:43,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:43,785 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:50:43,787 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:50:43,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:50:43,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:50:43,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:50:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:43,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:50:43,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:50:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:43,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:50:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493198668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:50:44,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:50:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:50:44,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275306245] [2025-04-13 19:50:44,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:50:44,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:50:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:50:44,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:50:44,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:50:44,007 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:50:44,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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:44,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:50:44,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:50:44,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:50:44,199 INFO L116 PetriNetUnfolderBase]: 1447/1984 cut-off events. [2025-04-13 19:50:44,200 INFO L117 PetriNetUnfolderBase]: For 6973/6993 co-relation queries the response was YES. [2025-04-13 19:50:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 1984 events. 1447/1984 cut-off events. For 6973/6993 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8178 event pairs, 375 based on Foata normal form. 72/2054 useless extension candidates. Maximal degree in co-relation 8581. Up to 1150 conditions per place. [2025-04-13 19:50:44,210 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 111 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-04-13 19:50:44,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1106 flow [2025-04-13 19:50:44,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:50:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:50:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-13 19:50:44,211 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2025-04-13 19:50:44,211 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 365 flow. Second operand 5 states and 106 transitions. [2025-04-13 19:50:44,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1106 flow [2025-04-13 19:50:44,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 1097 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:50:44,219 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 406 flow [2025-04-13 19:50:44,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2025-04-13 19:50:44,220 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2025-04-13 19:50:44,220 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 406 flow [2025-04-13 19:50:44,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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:44,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:50:44,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:44,228 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:50:44,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:44,421 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 2 more)] === [2025-04-13 19:50:44,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:50:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1553126014, now seen corresponding path program 1 times [2025-04-13 19:50:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:50:44,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982376244] [2025-04-13 19:50:44,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:50:44,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:50:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:50:44,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:50:44,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982376244] [2025-04-13 19:50:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982376244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:50:44,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786229221] [2025-04-13 19:50:44,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:50:44,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:50:44,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:50:44,788 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:50:44,788 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:50:44,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:50:44,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:50:44,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:50:44,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:50:44,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:50:44,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:51:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:51:15,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:51:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:51:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786229221] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:51:16,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:51:16,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:51:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242842938] [2025-04-13 19:51:16,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:51:16,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:51:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:51:16,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:51:16,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=167, Unknown=3, NotChecked=0, Total=240 [2025-04-13 19:51:16,385 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:51:16,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 406 flow. Second operand has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 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:16,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:51:16,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:51:16,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:51:24,373 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:26,617 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:30,940 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:31,998 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:36,819 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:39,182 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:44,495 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:47,333 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:49,333 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:53,575 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:54,942 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:58,945 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:00,541 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 19:52:00,607 INFO L116 PetriNetUnfolderBase]: 3088/4261 cut-off events. [2025-04-13 19:52:00,607 INFO L117 PetriNetUnfolderBase]: For 14061/14061 co-relation queries the response was YES. [2025-04-13 19:52:00,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21408 conditions, 4261 events. 3088/4261 cut-off events. For 14061/14061 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 20127 event pairs, 137 based on Foata normal form. 21/4280 useless extension candidates. Maximal degree in co-relation 19715. Up to 2243 conditions per place. [2025-04-13 19:52:00,629 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 215 selfloop transitions, 100 changer transitions 15/334 dead transitions. [2025-04-13 19:52:00,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 334 transitions, 2831 flow [2025-04-13 19:52:00,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:52:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:52:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 360 transitions. [2025-04-13 19:52:00,631 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-04-13 19:52:00,631 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 406 flow. Second operand 16 states and 360 transitions. [2025-04-13 19:52:00,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 334 transitions, 2831 flow [2025-04-13 19:52:00,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 334 transitions, 2783 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-13 19:52:00,647 INFO L231 Difference]: Finished difference. Result has 93 places, 152 transitions, 1637 flow [2025-04-13 19:52:00,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1637, PETRI_PLACES=93, PETRI_TRANSITIONS=152} [2025-04-13 19:52:00,647 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-13 19:52:00,647 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 152 transitions, 1637 flow [2025-04-13 19:52:00,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.4375) internal successors, (183), 16 states have internal predecessors, (183), 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:52:00,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:00,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:52:00,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:52:00,848 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,SelfDestructingSolverStorable9 [2025-04-13 19:52:00,848 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 2 more)] === [2025-04-13 19:52:00,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1435901466, now seen corresponding path program 1 times [2025-04-13 19:52:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:00,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264253875] [2025-04-13 19:52:00,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:52:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:00,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:52:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:52:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:52:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:01,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264253875] [2025-04-13 19:52:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264253875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:01,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489132692] [2025-04-13 19:52:01,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:52:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:01,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:01,162 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:52:01,163 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:52:01,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:52:01,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:52:01,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:52:01,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:01,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:52:01,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:52:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:42,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:52:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:48,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489132692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:52:48,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:52:48,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 19:52:48,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253044027] [2025-04-13 19:52:48,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:52:48,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:52:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:52:48,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:52:48,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=168, Unknown=7, NotChecked=0, Total=240 [2025-04-13 19:52:48,426 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:52:48,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 152 transitions, 1637 flow. Second operand has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 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:52:48,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:52:48,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:52:48,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:52:54,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:55,951 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:59,768 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:01,165 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:05,167 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:09,572 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:13,575 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:17,578 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:21,581 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:30,799 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:34,812 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:37,557 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:39,862 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:44,253 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:46,490 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:49,582 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:53:53,585 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:56,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:00,748 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:04,750 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:05,973 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:09,098 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:54:14,109 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:15,819 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:54:15,872 INFO L116 PetriNetUnfolderBase]: 4355/6013 cut-off events. [2025-04-13 19:54:15,872 INFO L117 PetriNetUnfolderBase]: For 28948/28948 co-relation queries the response was YES. [2025-04-13 19:54:15,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34756 conditions, 6013 events. 4355/6013 cut-off events. For 28948/28948 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 29726 event pairs, 364 based on Foata normal form. 22/6033 useless extension candidates. Maximal degree in co-relation 32783. Up to 4373 conditions per place. [2025-04-13 19:54:15,906 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 277 selfloop transitions, 100 changer transitions 26/407 dead transitions. [2025-04-13 19:54:15,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 407 transitions, 4317 flow [2025-04-13 19:54:15,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:54:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 19:54:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 344 transitions. [2025-04-13 19:54:15,908 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6527514231499051 [2025-04-13 19:54:15,908 INFO L175 Difference]: Start difference. First operand has 93 places, 152 transitions, 1637 flow. Second operand 17 states and 344 transitions. [2025-04-13 19:54:15,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 407 transitions, 4317 flow [2025-04-13 19:54:15,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 407 transitions, 4118 flow, removed 97 selfloop flow, removed 1 redundant places. [2025-04-13 19:54:15,958 INFO L231 Difference]: Finished difference. Result has 119 places, 250 transitions, 2835 flow [2025-04-13 19:54:15,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2835, PETRI_PLACES=119, PETRI_TRANSITIONS=250} [2025-04-13 19:54:15,959 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2025-04-13 19:54:15,959 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 250 transitions, 2835 flow [2025-04-13 19:54:15,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 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:54:15,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:54:15,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:54:15,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 19:54:16,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:54:16,160 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 2 more)] === [2025-04-13 19:54:16,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:54:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2091492892, now seen corresponding path program 2 times [2025-04-13 19:54:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:54:16,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990109904] [2025-04-13 19:54:16,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:54:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:54:16,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:54:16,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:54:16,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:54:16,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:54:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:54:16,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:54:16,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990109904] [2025-04-13 19:54:16,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990109904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:54:16,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274137000] [2025-04-13 19:54:16,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:54:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:54:16,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:54:16,346 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:54:16,347 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:54:16,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:54:16,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:54:16,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:54:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:54:16,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:54:16,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:11,900 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:55:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:29,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274137000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:55:30,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:55:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-13 19:55:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676042210] [2025-04-13 19:55:30,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:55:30,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:55:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:30,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:55:30,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=104, Unknown=3, NotChecked=0, Total=156 [2025-04-13 19:55:30,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:55:30,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 250 transitions, 2835 flow. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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:55:30,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:30,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:55:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:34,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 19:55:38,705 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:55:50,755 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:55:54,803 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:55:59,381 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:03,507 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:07,511 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:11,516 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:23,518 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:27,521 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:31,146 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:43,572 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:47,577 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:51,581 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:55,591 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:59,594 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:57:03,597 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:57:07,626 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:57:12,844 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:57:16,848 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:57:20,729 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:24,731 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:57:28,734 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:57:32,876 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:57:37,227 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:57:49,215 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:57:54,541 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:57:56,084 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:58,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:00,925 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:05,290 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:09,294 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:11,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:15,560 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:19,564 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:21,295 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:24,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:26,905 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:31,114 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:33,247 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:37,251 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:42,302 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:46,306 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:47,992 INFO L116 PetriNetUnfolderBase]: 5576/7700 cut-off events. [2025-04-13 19:58:47,992 INFO L117 PetriNetUnfolderBase]: For 56281/56281 co-relation queries the response was YES. [2025-04-13 19:58:48,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50933 conditions, 7700 events. 5576/7700 cut-off events. For 56281/56281 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 39454 event pairs, 462 based on Foata normal form. 22/7720 useless extension candidates. Maximal degree in co-relation 49467. Up to 5963 conditions per place. [2025-04-13 19:58:48,056 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 374 selfloop transitions, 113 changer transitions 33/524 dead transitions. [2025-04-13 19:58:48,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 524 transitions, 6555 flow [2025-04-13 19:58:48,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 19:58:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 19:58:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 391 transitions. [2025-04-13 19:58:48,058 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6306451612903226 [2025-04-13 19:58:48,059 INFO L175 Difference]: Start difference. First operand has 119 places, 250 transitions, 2835 flow. Second operand 20 states and 391 transitions. [2025-04-13 19:58:48,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 524 transitions, 6555 flow [2025-04-13 19:58:48,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 524 transitions, 6154 flow, removed 198 selfloop flow, removed 1 redundant places. [2025-04-13 19:58:48,204 INFO L231 Difference]: Finished difference. Result has 150 places, 353 transitions, 4197 flow [2025-04-13 19:58:48,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4197, PETRI_PLACES=150, PETRI_TRANSITIONS=353} [2025-04-13 19:58:48,205 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 115 predicate places. [2025-04-13 19:58:48,205 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 353 transitions, 4197 flow [2025-04-13 19:58:48,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 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:58:48,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:48,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:48,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:58:48,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:48,410 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 2 more)] === [2025-04-13 19:58:48,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1041048288, now seen corresponding path program 2 times [2025-04-13 19:58:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:48,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936828127] [2025-04-13 19:58:48,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:48,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:58:48,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:58:48,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:48,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:48,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:48,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936828127] [2025-04-13 19:58:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936828127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:48,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754292041] [2025-04-13 19:58:48,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:48,584 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:58:48,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:58:48,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 19:58:48,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:58:48,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:48,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:48,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:58:48,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:33,130 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:59:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:46,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754292041] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:46,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 6, 5] total 12 [2025-04-13 19:59:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798364453] [2025-04-13 19:59:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:46,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:59:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:46,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:59:46,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=116, Unknown=5, NotChecked=0, Total=182 [2025-04-13 19:59:46,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 19:59:46,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 353 transitions, 4197 flow. Second operand has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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:59:46,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:46,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 19:59:46,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:58,072 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:02,075 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:06,084 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:07,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:11,276 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:12,461 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:20,874 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:24,888 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:28,894 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:37,248 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:38,598 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:40,102 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:00:57,030 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:01,055 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:05,059 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:09,063 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:14,101 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:18,243 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:22,324 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:26,329 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:30,341 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:34,345 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:35,639 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:01:43,133 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:47,593 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:51,596 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:55,612 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:02:00,352 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:02:04,712 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:02:08,715 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:02:12,718 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:02:16,750 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:02:20,799 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:02:25,329 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:02:29,334 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:02:33,343 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:02:37,347 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:02:41,349 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:02:45,586 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:02:50,563 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:02:55,464 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:02:59,854 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:03:04,151 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:03:08,175 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:03:12,205 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:03:16,213 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:03:18,447 INFO L116 PetriNetUnfolderBase]: 8024/11208 cut-off events. [2025-04-13 20:03:18,448 INFO L117 PetriNetUnfolderBase]: For 111124/111124 co-relation queries the response was YES. [2025-04-13 20:03:18,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77199 conditions, 11208 events. 8024/11208 cut-off events. For 111124/111124 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 62200 event pairs, 481 based on Foata normal form. 48/11254 useless extension candidates. Maximal degree in co-relation 76581. Up to 7611 conditions per place. [2025-04-13 20:03:18,588 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 547 selfloop transitions, 184 changer transitions 19/754 dead transitions. [2025-04-13 20:03:18,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 754 transitions, 9403 flow [2025-04-13 20:03:18,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:03:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:03:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 456 transitions. [2025-04-13 20:03:18,590 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7354838709677419 [2025-04-13 20:03:18,590 INFO L175 Difference]: Start difference. First operand has 150 places, 353 transitions, 4197 flow. Second operand 20 states and 456 transitions. [2025-04-13 20:03:18,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 754 transitions, 9403 flow [2025-04-13 20:03:18,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 754 transitions, 8704 flow, removed 347 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:18,927 INFO L231 Difference]: Finished difference. Result has 180 places, 507 transitions, 6257 flow [2025-04-13 20:03:18,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3572, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6257, PETRI_PLACES=180, PETRI_TRANSITIONS=507} [2025-04-13 20:03:18,928 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 145 predicate places. [2025-04-13 20:03:18,928 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 507 transitions, 6257 flow [2025-04-13 20:03:18,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:18,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:18,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:18,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:03:19,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:03:19,129 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:03:19,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1058492094, now seen corresponding path program 3 times [2025-04-13 20:03:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:19,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19535675] [2025-04-13 20:03:19,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:19,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:03:19,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:03:19,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:03:19,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:19,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19535675] [2025-04-13 20:03:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19535675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:19,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277740767] [2025-04-13 20:03:19,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:19,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:19,250 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:03:19,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:03:19,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:03:19,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:03:19,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:03:19,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:19,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:03:19,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:20,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277740767] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:03:20,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:03:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 20:03:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474275480] [2025-04-13 20:03:20,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:03:20,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:03:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:20,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:03:20,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:03:20,373 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:03:20,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 507 transitions, 6257 flow. Second operand has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:20,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:20,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:03:20,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:23,336 INFO L116 PetriNetUnfolderBase]: 9632/13391 cut-off events. [2025-04-13 20:03:23,336 INFO L117 PetriNetUnfolderBase]: For 175288/175288 co-relation queries the response was YES. [2025-04-13 20:03:23,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99704 conditions, 13391 events. 9632/13391 cut-off events. For 175288/175288 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 75541 event pairs, 343 based on Foata normal form. 144/13533 useless extension candidates. Maximal degree in co-relation 99060. Up to 3515 conditions per place. [2025-04-13 20:03:23,440 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 763 selfloop transitions, 159 changer transitions 20/946 dead transitions. [2025-04-13 20:03:23,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 946 transitions, 13259 flow [2025-04-13 20:03:23,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:03:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:03:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 270 transitions. [2025-04-13 20:03:23,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-04-13 20:03:23,442 INFO L175 Difference]: Start difference. First operand has 180 places, 507 transitions, 6257 flow. Second operand 12 states and 270 transitions. [2025-04-13 20:03:23,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 946 transitions, 13259 flow [2025-04-13 20:03:24,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 946 transitions, 12488 flow, removed 382 selfloop flow, removed 1 redundant places. [2025-04-13 20:03:24,071 INFO L231 Difference]: Finished difference. Result has 195 places, 539 transitions, 6768 flow [2025-04-13 20:03:24,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=5732, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6768, PETRI_PLACES=195, PETRI_TRANSITIONS=539} [2025-04-13 20:03:24,071 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 160 predicate places. [2025-04-13 20:03:24,071 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 539 transitions, 6768 flow [2025-04-13 20:03:24,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5625) internal successors, (185), 16 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:24,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:24,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:24,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:03:24,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:03:24,272 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:03:24,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash 119291650, now seen corresponding path program 3 times [2025-04-13 20:03:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:24,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154824992] [2025-04-13 20:03:24,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:24,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:03:24,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:03:24,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:03:24,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:24,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154824992] [2025-04-13 20:03:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154824992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:24,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579212662] [2025-04-13 20:03:24,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:03:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:24,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:03:24,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:03:24,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:03:24,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:03:24,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:03:24,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:24,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:03:24,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:26,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:03:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579212662] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:03:31,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:03:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 20:03:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108799410] [2025-04-13 20:03:31,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:03:31,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:03:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:31,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:03:31,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:03:31,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-13 20:03:31,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 539 transitions, 6768 flow. Second operand has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:03:31,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:31,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-13 20:03:31,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:40,224 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:03:44,283 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:03:49,639 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:03:53,706 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:04:00,424 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:04:05,669 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:04:08,483 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:04:14,667 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:04:16,343 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:04:20,816 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:04:25,705 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:04:30,388 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:04:34,393 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:04:38,397 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:04:42,402 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:04:46,406 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:04:50,424 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:04:54,431 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:04:58,587 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:05:02,591 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:05:06,595 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:05:10,600 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:05:14,603 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 [] Received shutdown request... [2025-04-13 20:05:15,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:05:15,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:05:16,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:05:16,897 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 20:05:16,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 20:05:16,910 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 20:05:16,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:05:16,911 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 20:05:16,912 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 20:05:16,912 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 20:05:16,912 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 20:05:16,912 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 20:05:16,912 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1] [2025-04-13 20:05:16,917 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:05:16,917 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:05:16,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:05:16 BasicIcfg [2025-04-13 20:05:16,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:05:16,921 INFO L158 Benchmark]: Toolchain (without parser) took 878728.87ms. Allocated memory was 155.2MB in the beginning and 989.9MB in the end (delta: 834.7MB). Free memory was 107.7MB in the beginning and 607.6MB in the end (delta: -499.9MB). Peak memory consumption was 335.3MB. Max. memory is 8.0GB. [2025-04-13 20:05:16,921 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:05:16,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.30ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:05:16,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.41ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:05:16,922 INFO L158 Benchmark]: Boogie Preprocessor took 43.76ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:05:16,923 INFO L158 Benchmark]: RCFGBuilder took 483.39ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 53.2MB in the end (delta: 36.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 20:05:16,923 INFO L158 Benchmark]: TraceAbstraction took 877906.13ms. Allocated memory was 155.2MB in the beginning and 989.9MB in the end (delta: 834.7MB). Free memory was 52.7MB in the beginning and 607.6MB in the end (delta: -554.9MB). Peak memory consumption was 280.8MB. Max. memory is 8.0GB. [2025-04-13 20:05:16,926 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.30ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.41ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.76ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 483.39ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 53.2MB in the end (delta: 36.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 877906.13ms. Allocated memory was 155.2MB in the beginning and 989.9MB in the end (delta: 834.7MB). Free memory was 52.7MB in the beginning and 607.6MB in the end (delta: -554.9MB). Peak memory consumption was 280.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 44 locations, 51 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 877.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 653.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 107 mSolverCounterUnknown, 1239 SdHoareTripleChecker+Valid, 557.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1239 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 556.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4701 IncrementalHoareTripleChecker+Invalid, 4974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 0 mSDtfsCounter, 4701 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 400 SyntacticMatches, 19 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 243.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6768occurred in iteration=14, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 220.7s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 13419 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1574 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 9/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown