/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/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:12:20,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:12:20,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:12:20,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:12:20,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:12:20,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:12:20,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:12:20,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:12:20,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:12:20,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:12:20,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:12:20,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:12:20,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:12:20,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:12:20,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:20,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:20,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:12:20,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:12:20,304 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:12:20,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:12:20,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:12:20,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:12:20,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:12:20,533 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:12:20,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-13 20:12:21,779 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93e93f3d/c64ae1c393b7402a8a0520e8d7aa1590/FLAG5720a9943 [2025-04-13 20:12:21,985 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:12:21,986 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-13 20:12:21,991 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93e93f3d/c64ae1c393b7402a8a0520e8d7aa1590/FLAG5720a9943 [2025-04-13 20:12:22,830 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93e93f3d/c64ae1c393b7402a8a0520e8d7aa1590 [2025-04-13 20:12:22,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:12:22,833 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:12:22,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:12:22,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:12:22,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:12:22,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:12:22" (1/1) ... [2025-04-13 20:12:22,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96c98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:22, skipping insertion in model container [2025-04-13 20:12:22,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:12:22" (1/1) ... [2025-04-13 20:12:22,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:12:23,016 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/mult-comm.wvr.c[1936,1949] [2025-04-13 20:12:23,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:12:23,028 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:12:23,054 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/mult-comm.wvr.c[1936,1949] [2025-04-13 20:12:23,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:12:23,070 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:12:23,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23 WrapperNode [2025-04-13 20:12:23,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:12:23,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:12:23,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:12:23,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:12:23,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,097 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-04-13 20:12:23,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:12:23,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:12:23,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:12:23,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:12:23,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,114 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 20:12:23,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:12:23,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:12:23,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:12:23,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:12:23,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (1/1) ... [2025-04-13 20:12:23,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:23,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:12:23,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:12:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:12:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:12:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:12:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:12:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:12:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:12:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:12:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:12:23,166 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:12:23,219 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:12:23,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:12:23,324 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:12:23,325 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:12:23,325 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:12:23,428 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:12:23,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:12:23 BoogieIcfgContainer [2025-04-13 20:12:23,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:12:23,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:12:23,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:12:23,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:12:23,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:12:22" (1/3) ... [2025-04-13 20:12:23,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5022bdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:12:23, skipping insertion in model container [2025-04-13 20:12:23,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:23" (2/3) ... [2025-04-13 20:12:23,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5022bdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:12:23, skipping insertion in model container [2025-04-13 20:12:23,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:12:23" (3/3) ... [2025-04-13 20:12:23,435 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-04-13 20:12:23,445 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:12:23,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:12:23,446 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:12:23,486 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:12:23,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 20:12:23,536 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-13 20:12:23,537 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:12:23,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 20:12:23,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 20:12:23,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-13 20:12:23,550 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:12:23,561 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;@309fb2d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:12:23,561 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:12:23,567 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:12:23,569 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-13 20:12:23,569 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:12:23,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:23,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:23,570 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:23,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1286890524, now seen corresponding path program 1 times [2025-04-13 20:12:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:23,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939981797] [2025-04-13 20:12:23,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:23,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:12:23,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:12:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:23,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939981797] [2025-04-13 20:12:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939981797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:23,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:23,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:12:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525398763] [2025-04-13 20:12:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:23,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:12:23,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:23,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:12:23,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:12:23,933 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:23,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:12:23,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:23,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:23,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:24,017 INFO L116 PetriNetUnfolderBase]: 68/122 cut-off events. [2025-04-13 20:12:24,017 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 20:12:24,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 122 events. 68/122 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 313 event pairs, 22 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-04-13 20:12:24,021 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2025-04-13 20:12:24,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 25 transitions, 121 flow [2025-04-13 20:12:24,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:12:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:12:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-04-13 20:12:24,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2025-04-13 20:12:24,033 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 32 transitions. [2025-04-13 20:12:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 25 transitions, 121 flow [2025-04-13 20:12:24,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 25 transitions, 107 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:12:24,037 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 51 flow [2025-04-13 20:12:24,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2025-04-13 20:12:24,041 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-13 20:12:24,041 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 51 flow [2025-04-13 20:12:24,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:12:24,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:24,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:24,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:12:24,042 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:24,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 933172688, now seen corresponding path program 1 times [2025-04-13 20:12:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:24,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348378187] [2025-04-13 20:12:24,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:12:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:24,233 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 20:12:24,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:24,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348378187] [2025-04-13 20:12:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348378187] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:24,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359254473] [2025-04-13 20:12:24,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:24,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:24,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:24,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:12:24,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:12:24,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:24,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:24,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:24,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:12:24,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:24,468 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 20:12:24,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:24,728 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 20:12:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359254473] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:24,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 11 [2025-04-13 20:12:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451046286] [2025-04-13 20:12:24,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:24,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:12:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:24,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:12:24,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:12:24,731 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:24,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 51 flow. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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:12:24,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:24,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:24,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:24,972 INFO L116 PetriNetUnfolderBase]: 82/149 cut-off events. [2025-04-13 20:12:24,972 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-13 20:12:24,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 149 events. 82/149 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 471 event pairs, 2 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2025-04-13 20:12:24,975 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 23 selfloop transitions, 5 changer transitions 22/50 dead transitions. [2025-04-13 20:12:24,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 50 transitions, 241 flow [2025-04-13 20:12:24,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:12:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:12:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2025-04-13 20:12:24,977 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2025-04-13 20:12:24,977 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 51 flow. Second operand 8 states and 67 transitions. [2025-04-13 20:12:24,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 50 transitions, 241 flow [2025-04-13 20:12:24,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 50 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:24,978 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 84 flow [2025-04-13 20:12:24,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=84, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2025-04-13 20:12:24,979 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2025-04-13 20:12:24,979 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 84 flow [2025-04-13 20:12:24,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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:12:24,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:24,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:24,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:25,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:25,180 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:25,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1006000951, now seen corresponding path program 1 times [2025-04-13 20:12:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:25,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981446636] [2025-04-13 20:12:25,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:25,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:12:25,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:25,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:25,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:25,334 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 20:12:25,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:25,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981446636] [2025-04-13 20:12:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981446636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:25,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881920934] [2025-04-13 20:12:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:25,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:25,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:25,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:12:25,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:12:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:25,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:25,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:12:25,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:25,428 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 20:12:25,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:25,553 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 20:12:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881920934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:25,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2025-04-13 20:12:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483021088] [2025-04-13 20:12:25,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:25,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:12:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:25,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:12:25,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:12:25,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:25,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:25,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:25,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:25,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:25,666 INFO L116 PetriNetUnfolderBase]: 56/104 cut-off events. [2025-04-13 20:12:25,666 INFO L117 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-04-13 20:12:25,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 104 events. 56/104 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 243 event pairs, 9 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 334. Up to 67 conditions per place. [2025-04-13 20:12:25,667 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 19 selfloop transitions, 6 changer transitions 9/34 dead transitions. [2025-04-13 20:12:25,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 215 flow [2025-04-13 20:12:25,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:12:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:12:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-13 20:12:25,669 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-13 20:12:25,669 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 84 flow. Second operand 6 states and 46 transitions. [2025-04-13 20:12:25,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 215 flow [2025-04-13 20:12:25,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 179 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-13 20:12:25,671 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 92 flow [2025-04-13 20:12:25,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2025-04-13 20:12:25,672 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 9 predicate places. [2025-04-13 20:12:25,672 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 92 flow [2025-04-13 20:12:25,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:25,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:25,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:25,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:12:25,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 20:12:25,878 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:25,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 44737855, now seen corresponding path program 2 times [2025-04-13 20:12:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:25,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144040381] [2025-04-13 20:12:25,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:25,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:25,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:25,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:25,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:26,061 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 20:12:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:26,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144040381] [2025-04-13 20:12:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144040381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:26,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804758719] [2025-04-13 20:12:26,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:26,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:26,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:26,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:26,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:12:26,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:26,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:26,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:26,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:12:26,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:26,148 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 20:12:26,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:26,219 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 20:12:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804758719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:26,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:26,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2025-04-13 20:12:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628507198] [2025-04-13 20:12:26,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:26,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:12:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:26,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:12:26,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:12:26,222 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:26,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 92 flow. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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:12:26,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:26,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:26,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:26,374 INFO L116 PetriNetUnfolderBase]: 103/190 cut-off events. [2025-04-13 20:12:26,374 INFO L117 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-04-13 20:12:26,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 190 events. 103/190 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 578 event pairs, 13 based on Foata normal form. 3/193 useless extension candidates. Maximal degree in co-relation 549. Up to 84 conditions per place. [2025-04-13 20:12:26,375 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 18 changer transitions 9/61 dead transitions. [2025-04-13 20:12:26,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 348 flow [2025-04-13 20:12:26,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:12:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:12:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2025-04-13 20:12:26,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2025-04-13 20:12:26,379 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 92 flow. Second operand 10 states and 82 transitions. [2025-04-13 20:12:26,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 348 flow [2025-04-13 20:12:26,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 61 transitions, 335 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:26,381 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 194 flow [2025-04-13 20:12:26,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-04-13 20:12:26,381 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 19 predicate places. [2025-04-13 20:12:26,381 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 194 flow [2025-04-13 20:12:26,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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:12:26,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:26,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:26,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:26,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:26,582 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:26,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash 959023645, now seen corresponding path program 3 times [2025-04-13 20:12:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:26,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579295553] [2025-04-13 20:12:26,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:26,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:26,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:26,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:26,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:26,725 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 20:12:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:26,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579295553] [2025-04-13 20:12:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579295553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:26,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138060033] [2025-04-13 20:12:26,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:26,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:26,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:26,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:12:26,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:26,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:26,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:26,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:26,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:12:26,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:26,814 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 20:12:26,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:26,927 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 20:12:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138060033] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:26,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2025-04-13 20:12:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745994478] [2025-04-13 20:12:26,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:26,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:12:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:12:26,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:12:26,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:26,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 194 flow. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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:12:26,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:26,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:26,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:27,051 INFO L116 PetriNetUnfolderBase]: 117/214 cut-off events. [2025-04-13 20:12:27,052 INFO L117 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2025-04-13 20:12:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 214 events. 117/214 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 699 event pairs, 18 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 721. Up to 159 conditions per place. [2025-04-13 20:12:27,053 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 38 selfloop transitions, 14 changer transitions 6/58 dead transitions. [2025-04-13 20:12:27,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 413 flow [2025-04-13 20:12:27,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:12:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:12:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-04-13 20:12:27,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-13 20:12:27,054 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 194 flow. Second operand 8 states and 64 transitions. [2025-04-13 20:12:27,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 413 flow [2025-04-13 20:12:27,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 355 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-13 20:12:27,057 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 230 flow [2025-04-13 20:12:27,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-04-13 20:12:27,057 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 25 predicate places. [2025-04-13 20:12:27,057 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 230 flow [2025-04-13 20:12:27,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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:12:27,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:27,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:27,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:27,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:27,258 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:27,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1044911098, now seen corresponding path program 2 times [2025-04-13 20:12:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:27,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223136512] [2025-04-13 20:12:27,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:27,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:27,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:27,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:27,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:27,379 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 20:12:27,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:27,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223136512] [2025-04-13 20:12:27,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223136512] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:27,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494234527] [2025-04-13 20:12:27,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:27,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:27,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:27,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:12:27,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:27,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:27,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:27,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:12:27,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:27,469 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 20:12:27,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:27,608 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 20:12:27,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494234527] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:27,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:27,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2025-04-13 20:12:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730984951] [2025-04-13 20:12:27,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:27,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:12:27,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:27,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:12:27,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:12:27,610 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:27,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 230 flow. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:27,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:27,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:27,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:27,705 INFO L116 PetriNetUnfolderBase]: 145/264 cut-off events. [2025-04-13 20:12:27,705 INFO L117 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-04-13 20:12:27,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 264 events. 145/264 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 939 event pairs, 24 based on Foata normal form. 2/264 useless extension candidates. Maximal degree in co-relation 888. Up to 209 conditions per place. [2025-04-13 20:12:27,707 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 48 selfloop transitions, 14 changer transitions 4/66 dead transitions. [2025-04-13 20:12:27,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 487 flow [2025-04-13 20:12:27,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:12:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:12:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-04-13 20:12:27,712 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-13 20:12:27,712 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 230 flow. Second operand 8 states and 64 transitions. [2025-04-13 20:12:27,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 487 flow [2025-04-13 20:12:27,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 441 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-04-13 20:12:27,717 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 281 flow [2025-04-13 20:12:27,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-04-13 20:12:27,717 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 31 predicate places. [2025-04-13 20:12:27,717 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 281 flow [2025-04-13 20:12:27,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:27,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:27,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:27,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:12:27,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:27,918 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:27,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -639074494, now seen corresponding path program 3 times [2025-04-13 20:12:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:27,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194092454] [2025-04-13 20:12:27,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:27,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:27,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:27,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:27,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:28,027 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 20:12:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:28,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194092454] [2025-04-13 20:12:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194092454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:28,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884511734] [2025-04-13 20:12:28,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:28,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:28,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:12:28,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-13 20:12:28,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:12:28,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:28,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:28,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:12:28,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:28,131 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 20:12:28,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:28,198 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 20:12:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884511734] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:28,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2025-04-13 20:12:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626766437] [2025-04-13 20:12:28,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:28,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:12:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:28,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:12:28,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:12:28,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:28,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 281 flow. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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 20:12:28,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:28,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:28,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:28,376 INFO L116 PetriNetUnfolderBase]: 183/335 cut-off events. [2025-04-13 20:12:28,376 INFO L117 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2025-04-13 20:12:28,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 335 events. 183/335 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1286 event pairs, 37 based on Foata normal form. 3/336 useless extension candidates. Maximal degree in co-relation 1179. Up to 238 conditions per place. [2025-04-13 20:12:28,379 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 54 selfloop transitions, 20 changer transitions 7/81 dead transitions. [2025-04-13 20:12:28,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 614 flow [2025-04-13 20:12:28,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:12:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:12:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2025-04-13 20:12:28,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45294117647058824 [2025-04-13 20:12:28,380 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 281 flow. Second operand 10 states and 77 transitions. [2025-04-13 20:12:28,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 614 flow [2025-04-13 20:12:28,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 569 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-04-13 20:12:28,383 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 374 flow [2025-04-13 20:12:28,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=374, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2025-04-13 20:12:28,384 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 40 predicate places. [2025-04-13 20:12:28,384 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 374 flow [2025-04-13 20:12:28,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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 20:12:28,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:28,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:28,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:12:28,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:28,585 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:28,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1387618235, now seen corresponding path program 1 times [2025-04-13 20:12:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:28,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504858087] [2025-04-13 20:12:28,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:12:28,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:12:28,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:28,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:28,890 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 20:12:28,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:28,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504858087] [2025-04-13 20:12:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504858087] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:28,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955952436] [2025-04-13 20:12:28,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:28,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:28,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:28,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:12:28,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:12:28,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:12:28,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:28,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:28,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:12:28,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:29,145 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 20:12:29,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:29,432 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 20:12:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955952436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:29,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:12:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300732236] [2025-04-13 20:12:29,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:29,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:12:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:29,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:12:29,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:12:29,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:29,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 374 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 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:12:29,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:29,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:33,924 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:12:38,048 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:12:38,330 INFO L116 PetriNetUnfolderBase]: 253/480 cut-off events. [2025-04-13 20:12:38,330 INFO L117 PetriNetUnfolderBase]: For 939/939 co-relation queries the response was YES. [2025-04-13 20:12:38,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 480 events. 253/480 cut-off events. For 939/939 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2188 event pairs, 25 based on Foata normal form. 3/481 useless extension candidates. Maximal degree in co-relation 1688. Up to 240 conditions per place. [2025-04-13 20:12:38,333 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 83 selfloop transitions, 49 changer transitions 30/162 dead transitions. [2025-04-13 20:12:38,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 162 transitions, 1158 flow [2025-04-13 20:12:38,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:12:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:12:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2025-04-13 20:12:38,338 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42892156862745096 [2025-04-13 20:12:38,338 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 374 flow. Second operand 24 states and 175 transitions. [2025-04-13 20:12:38,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 162 transitions, 1158 flow [2025-04-13 20:12:38,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 162 transitions, 1095 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-04-13 20:12:38,346 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 624 flow [2025-04-13 20:12:38,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=624, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2025-04-13 20:12:38,348 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 70 predicate places. [2025-04-13 20:12:38,348 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 624 flow [2025-04-13 20:12:38,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 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:12:38,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:38,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:38,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:38,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:38,549 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:38,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash 336570547, now seen corresponding path program 2 times [2025-04-13 20:12:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:38,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146215798] [2025-04-13 20:12:38,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:38,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:38,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:12:38,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:12:38,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:38,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:38,969 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 20:12:38,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:38,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146215798] [2025-04-13 20:12:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146215798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:38,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269971607] [2025-04-13 20:12:38,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:38,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:38,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:38,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:12:38,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:12:39,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:12:39,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:39,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:39,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:12:39,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:39,247 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 20:12:39,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:39,554 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 20:12:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269971607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:39,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:12:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097138117] [2025-04-13 20:12:39,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:39,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:12:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:39,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:12:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:12:39,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:39,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 624 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:39,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:39,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:39,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:44,116 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:12:45,392 INFO L116 PetriNetUnfolderBase]: 286/566 cut-off events. [2025-04-13 20:12:45,393 INFO L117 PetriNetUnfolderBase]: For 3139/3139 co-relation queries the response was YES. [2025-04-13 20:12:45,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 566 events. 286/566 cut-off events. For 3139/3139 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2829 event pairs, 20 based on Foata normal form. 3/567 useless extension candidates. Maximal degree in co-relation 2542. Up to 244 conditions per place. [2025-04-13 20:12:45,396 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 94 selfloop transitions, 77 changer transitions 15/186 dead transitions. [2025-04-13 20:12:45,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 186 transitions, 1760 flow [2025-04-13 20:12:45,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 20:12:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 20:12:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2025-04-13 20:12:45,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-04-13 20:12:45,398 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 624 flow. Second operand 27 states and 198 transitions. [2025-04-13 20:12:45,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 186 transitions, 1760 flow [2025-04-13 20:12:45,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 186 transitions, 1548 flow, removed 88 selfloop flow, removed 12 redundant places. [2025-04-13 20:12:45,412 INFO L231 Difference]: Finished difference. Result has 104 places, 115 transitions, 1025 flow [2025-04-13 20:12:45,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1025, PETRI_PLACES=104, PETRI_TRANSITIONS=115} [2025-04-13 20:12:45,412 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 85 predicate places. [2025-04-13 20:12:45,413 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 115 transitions, 1025 flow [2025-04-13 20:12:45,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:45,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:45,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:45,421 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:12:45,613 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,SelfDestructingSolverStorable8 [2025-04-13 20:12:45,614 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:45,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 339251737, now seen corresponding path program 3 times [2025-04-13 20:12:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:45,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866288180] [2025-04-13 20:12:45,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:45,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:12:45,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:12:45,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:45,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:45,982 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 20:12:45,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:45,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866288180] [2025-04-13 20:12:45,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866288180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:45,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100469526] [2025-04-13 20:12:45,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:45,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:45,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:45,984 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:12:45,986 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:12:46,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:12:46,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:12:46,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:12:46,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:46,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:12:46,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:47,803 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 20:12:47,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:48,127 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 20:12:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100469526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:48,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:12:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330308847] [2025-04-13 20:12:48,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:48,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:12:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:48,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:12:48,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:12:48,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:48,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 115 transitions, 1025 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:48,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:48,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:48,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:52,567 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:12:53,603 INFO L116 PetriNetUnfolderBase]: 277/537 cut-off events. [2025-04-13 20:12:53,604 INFO L117 PetriNetUnfolderBase]: For 2497/2497 co-relation queries the response was YES. [2025-04-13 20:12:53,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 537 events. 277/537 cut-off events. For 2497/2497 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2594 event pairs, 20 based on Foata normal form. 3/532 useless extension candidates. Maximal degree in co-relation 2524. Up to 247 conditions per place. [2025-04-13 20:12:53,609 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 81 selfloop transitions, 79 changer transitions 14/174 dead transitions. [2025-04-13 20:12:53,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 174 transitions, 1646 flow [2025-04-13 20:12:53,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:12:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:12:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 173 transitions. [2025-04-13 20:12:53,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42401960784313725 [2025-04-13 20:12:53,611 INFO L175 Difference]: Start difference. First operand has 104 places, 115 transitions, 1025 flow. Second operand 24 states and 173 transitions. [2025-04-13 20:12:53,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 174 transitions, 1646 flow [2025-04-13 20:12:53,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 174 transitions, 1299 flow, removed 153 selfloop flow, removed 13 redundant places. [2025-04-13 20:12:53,638 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 956 flow [2025-04-13 20:12:53,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=956, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2025-04-13 20:12:53,639 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 98 predicate places. [2025-04-13 20:12:53,639 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 956 flow [2025-04-13 20:12:53,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:53,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:53,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:53,648 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:12:53,840 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,SelfDestructingSolverStorable9 [2025-04-13 20:12:53,840 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:53,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1668678972, now seen corresponding path program 4 times [2025-04-13 20:12:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:53,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353717423] [2025-04-13 20:12:53,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:53,843 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:12:53,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:12:53,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:54,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353717423] [2025-04-13 20:12:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353717423] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:54,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531705856] [2025-04-13 20:12:54,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:54,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:54,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:54,207 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:12:54,208 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:12:54,231 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:12:54,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:12:54,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:54,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:54,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:12:54,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:54,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:12:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531705856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:59,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:12:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-04-13 20:12:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808221549] [2025-04-13 20:12:59,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:59,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:12:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:59,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:12:59,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2025-04-13 20:12:59,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:12:59,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 956 flow. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:12:59,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:59,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:12:59,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:04,307 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:13:09,014 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:13:13,064 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:13:17,487 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:13:21,498 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:13:21,742 INFO L116 PetriNetUnfolderBase]: 382/717 cut-off events. [2025-04-13 20:13:21,742 INFO L117 PetriNetUnfolderBase]: For 2355/2355 co-relation queries the response was YES. [2025-04-13 20:13:21,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 717 events. 382/717 cut-off events. For 2355/2355 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3591 event pairs, 20 based on Foata normal form. 5/706 useless extension candidates. Maximal degree in co-relation 3253. Up to 351 conditions per place. [2025-04-13 20:13:21,746 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 124 selfloop transitions, 87 changer transitions 25/236 dead transitions. [2025-04-13 20:13:21,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 236 transitions, 2130 flow [2025-04-13 20:13:21,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 20:13:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 20:13:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 229 transitions. [2025-04-13 20:13:21,748 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40819964349376114 [2025-04-13 20:13:21,748 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 956 flow. Second operand 33 states and 229 transitions. [2025-04-13 20:13:21,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 236 transitions, 2130 flow [2025-04-13 20:13:21,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 236 transitions, 1925 flow, removed 39 selfloop flow, removed 19 redundant places. [2025-04-13 20:13:21,756 INFO L231 Difference]: Finished difference. Result has 136 places, 154 transitions, 1377 flow [2025-04-13 20:13:21,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1377, PETRI_PLACES=136, PETRI_TRANSITIONS=154} [2025-04-13 20:13:21,758 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 117 predicate places. [2025-04-13 20:13:21,758 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 154 transitions, 1377 flow [2025-04-13 20:13:21,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:21,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:21,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:21,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:21,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 20:13:21,959 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:21,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash -975163491, now seen corresponding path program 5 times [2025-04-13 20:13:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:21,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728289600] [2025-04-13 20:13:21,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:21,962 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:21,967 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:21,968 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:21,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:22,192 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 20:13:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:22,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728289600] [2025-04-13 20:13:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728289600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:22,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827676342] [2025-04-13 20:13:22,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:22,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:22,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:22,194 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:22,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:13:22,222 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:22,249 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:22,249 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:22,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:22,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:22,496 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 20:13:22,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:23,190 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 20:13:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827676342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:23,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 20:13:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798208148] [2025-04-13 20:13:23,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:23,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:13:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:23,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:13:23,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:13:23,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:23,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 154 transitions, 1377 flow. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:23,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:23,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:23,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:24,606 INFO L116 PetriNetUnfolderBase]: 430/801 cut-off events. [2025-04-13 20:13:24,606 INFO L117 PetriNetUnfolderBase]: For 3174/3174 co-relation queries the response was YES. [2025-04-13 20:13:24,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 801 events. 430/801 cut-off events. For 3174/3174 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4107 event pairs, 40 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 4045. Up to 668 conditions per place. [2025-04-13 20:13:24,612 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 170 selfloop transitions, 45 changer transitions 14/229 dead transitions. [2025-04-13 20:13:24,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 229 transitions, 2361 flow [2025-04-13 20:13:24,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:13:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:13:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2025-04-13 20:13:24,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41830065359477125 [2025-04-13 20:13:24,613 INFO L175 Difference]: Start difference. First operand has 136 places, 154 transitions, 1377 flow. Second operand 18 states and 128 transitions. [2025-04-13 20:13:24,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 229 transitions, 2361 flow [2025-04-13 20:13:24,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 229 transitions, 2045 flow, removed 132 selfloop flow, removed 13 redundant places. [2025-04-13 20:13:24,629 INFO L231 Difference]: Finished difference. Result has 145 places, 187 transitions, 1589 flow [2025-04-13 20:13:24,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1589, PETRI_PLACES=145, PETRI_TRANSITIONS=187} [2025-04-13 20:13:24,630 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 126 predicate places. [2025-04-13 20:13:24,630 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 187 transitions, 1589 flow [2025-04-13 20:13:24,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:24,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:24,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:24,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:13:24,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 20:13:24,831 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:24,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1164082198, now seen corresponding path program 4 times [2025-04-13 20:13:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:24,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480329462] [2025-04-13 20:13:24,831 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:24,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:24,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:24,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:24,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:24,939 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 20:13:24,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:24,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480329462] [2025-04-13 20:13:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480329462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:24,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166768788] [2025-04-13 20:13:24,939 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:24,942 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:24,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:13:24,965 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:24,999 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:24,999 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:24,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:25,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 20:13:25,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:25,084 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 20:13:25,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:25,191 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 20:13:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166768788] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:25,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2025-04-13 20:13:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874243156] [2025-04-13 20:13:25,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:25,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:13:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:25,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:13:25,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:13:25,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:25,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 187 transitions, 1589 flow. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:25,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:25,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:25,449 INFO L116 PetriNetUnfolderBase]: 429/810 cut-off events. [2025-04-13 20:13:25,449 INFO L117 PetriNetUnfolderBase]: For 2978/2978 co-relation queries the response was YES. [2025-04-13 20:13:25,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 810 events. 429/810 cut-off events. For 2978/2978 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4231 event pairs, 39 based on Foata normal form. 5/789 useless extension candidates. Maximal degree in co-relation 3918. Up to 670 conditions per place. [2025-04-13 20:13:25,454 INFO L140 encePairwiseOnDemand]: 10/17 looper letters, 169 selfloop transitions, 30 changer transitions 29/228 dead transitions. [2025-04-13 20:13:25,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 228 transitions, 2262 flow [2025-04-13 20:13:25,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:13:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:13:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2025-04-13 20:13:25,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4343891402714932 [2025-04-13 20:13:25,455 INFO L175 Difference]: Start difference. First operand has 145 places, 187 transitions, 1589 flow. Second operand 13 states and 96 transitions. [2025-04-13 20:13:25,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 228 transitions, 2262 flow [2025-04-13 20:13:25,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 228 transitions, 2170 flow, removed 34 selfloop flow, removed 4 redundant places. [2025-04-13 20:13:25,471 INFO L231 Difference]: Finished difference. Result has 155 places, 184 transitions, 1536 flow [2025-04-13 20:13:25,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1536, PETRI_PLACES=155, PETRI_TRANSITIONS=184} [2025-04-13 20:13:25,472 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 136 predicate places. [2025-04-13 20:13:25,472 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 184 transitions, 1536 flow [2025-04-13 20:13:25,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:25,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:25,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:25,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:13:25,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:13:25,673 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:25,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -523785315, now seen corresponding path program 6 times [2025-04-13 20:13:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:25,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39462530] [2025-04-13 20:13:25,674 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:25,677 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:25,681 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:25,682 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:25,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:25,901 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:13:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:25,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39462530] [2025-04-13 20:13:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39462530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:25,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143397407] [2025-04-13 20:13:25,902 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:25,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:25,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:25,903 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:25,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:13:25,929 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:25,943 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:25,944 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:25,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:25,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:25,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:26,062 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:13:26,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:26,757 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:13:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143397407] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:26,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:26,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 20:13:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466810552] [2025-04-13 20:13:26,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:26,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:13:26,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:26,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:13:26,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:13:26,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:26,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 184 transitions, 1536 flow. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:26,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:26,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:26,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:27,310 INFO L116 PetriNetUnfolderBase]: 451/842 cut-off events. [2025-04-13 20:13:27,310 INFO L117 PetriNetUnfolderBase]: For 3534/3534 co-relation queries the response was YES. [2025-04-13 20:13:27,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 842 events. 451/842 cut-off events. For 3534/3534 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4398 event pairs, 36 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 4218. Up to 697 conditions per place. [2025-04-13 20:13:27,315 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 182 selfloop transitions, 52 changer transitions 8/242 dead transitions. [2025-04-13 20:13:27,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 242 transitions, 2511 flow [2025-04-13 20:13:27,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:13:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:13:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 123 transitions. [2025-04-13 20:13:27,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2025-04-13 20:13:27,316 INFO L175 Difference]: Start difference. First operand has 155 places, 184 transitions, 1536 flow. Second operand 18 states and 123 transitions. [2025-04-13 20:13:27,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 242 transitions, 2511 flow [2025-04-13 20:13:27,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 242 transitions, 2426 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-04-13 20:13:27,331 INFO L231 Difference]: Finished difference. Result has 165 places, 205 transitions, 1929 flow [2025-04-13 20:13:27,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1929, PETRI_PLACES=165, PETRI_TRANSITIONS=205} [2025-04-13 20:13:27,332 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 146 predicate places. [2025-04-13 20:13:27,332 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 205 transitions, 1929 flow [2025-04-13 20:13:27,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:27,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:27,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:27,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:27,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:13:27,533 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:27,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash -468374055, now seen corresponding path program 7 times [2025-04-13 20:13:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:27,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454770973] [2025-04-13 20:13:27,533 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:27,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:13:27,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:27,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:27,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:27,724 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 20:13:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:27,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454770973] [2025-04-13 20:13:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454770973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:27,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532953210] [2025-04-13 20:13:27,725 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:27,727 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:27,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:13:27,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:13:27,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:27,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:27,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:27,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:27,878 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 20:13:27,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:28,446 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 20:13:28,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532953210] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:28,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:28,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017888939] [2025-04-13 20:13:28,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:28,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:28,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:28,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:28,448 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:28,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 205 transitions, 1929 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:28,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:28,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:28,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:28,885 INFO L116 PetriNetUnfolderBase]: 452/849 cut-off events. [2025-04-13 20:13:28,886 INFO L117 PetriNetUnfolderBase]: For 4133/4133 co-relation queries the response was YES. [2025-04-13 20:13:28,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4623 conditions, 849 events. 452/849 cut-off events. For 4133/4133 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4475 event pairs, 39 based on Foata normal form. 3/826 useless extension candidates. Maximal degree in co-relation 4537. Up to 756 conditions per place. [2025-04-13 20:13:28,891 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 188 selfloop transitions, 42 changer transitions 6/236 dead transitions. [2025-04-13 20:13:28,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 236 transitions, 2577 flow [2025-04-13 20:13:28,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:13:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:13:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2025-04-13 20:13:28,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2025-04-13 20:13:28,892 INFO L175 Difference]: Start difference. First operand has 165 places, 205 transitions, 1929 flow. Second operand 18 states and 113 transitions. [2025-04-13 20:13:28,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 236 transitions, 2577 flow [2025-04-13 20:13:28,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 236 transitions, 2370 flow, removed 85 selfloop flow, removed 9 redundant places. [2025-04-13 20:13:28,922 INFO L231 Difference]: Finished difference. Result has 177 places, 209 transitions, 1905 flow [2025-04-13 20:13:28,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1905, PETRI_PLACES=177, PETRI_TRANSITIONS=209} [2025-04-13 20:13:28,922 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 158 predicate places. [2025-04-13 20:13:28,922 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 209 transitions, 1905 flow [2025-04-13 20:13:28,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:28,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:28,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:28,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:29,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:29,127 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:29,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1085696311, now seen corresponding path program 8 times [2025-04-13 20:13:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:29,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878152147] [2025-04-13 20:13:29,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:29,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:29,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:29,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:29,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:29,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:29,352 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 20:13:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:29,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878152147] [2025-04-13 20:13:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878152147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:29,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103150647] [2025-04-13 20:13:29,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:29,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:29,355 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:29,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:13:29,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:29,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:29,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:29,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:29,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:29,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:29,506 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 20:13:29,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:30,049 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 20:13:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103150647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:30,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781918301] [2025-04-13 20:13:30,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:30,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:30,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:30,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:30,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:30,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 209 transitions, 1905 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:30,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:30,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:30,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:30,446 INFO L116 PetriNetUnfolderBase]: 469/873 cut-off events. [2025-04-13 20:13:30,446 INFO L117 PetriNetUnfolderBase]: For 4978/4978 co-relation queries the response was YES. [2025-04-13 20:13:30,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4784 conditions, 873 events. 469/873 cut-off events. For 4978/4978 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4596 event pairs, 37 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 4696. Up to 768 conditions per place. [2025-04-13 20:13:30,452 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 196 selfloop transitions, 42 changer transitions 8/246 dead transitions. [2025-04-13 20:13:30,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 246 transitions, 2690 flow [2025-04-13 20:13:30,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:13:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:13:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2025-04-13 20:13:30,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.396078431372549 [2025-04-13 20:13:30,453 INFO L175 Difference]: Start difference. First operand has 177 places, 209 transitions, 1905 flow. Second operand 15 states and 101 transitions. [2025-04-13 20:13:30,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 246 transitions, 2690 flow [2025-04-13 20:13:30,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 246 transitions, 2578 flow, removed 33 selfloop flow, removed 12 redundant places. [2025-04-13 20:13:30,474 INFO L231 Difference]: Finished difference. Result has 182 places, 218 transitions, 2090 flow [2025-04-13 20:13:30,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2090, PETRI_PLACES=182, PETRI_TRANSITIONS=218} [2025-04-13 20:13:30,475 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 163 predicate places. [2025-04-13 20:13:30,475 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 218 transitions, 2090 flow [2025-04-13 20:13:30,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:30,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:30,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:30,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:13:30,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:13:30,675 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:30,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1191877201, now seen corresponding path program 9 times [2025-04-13 20:13:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:30,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655000286] [2025-04-13 20:13:30,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:30,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:30,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:30,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:30,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:30,962 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:13:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:30,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655000286] [2025-04-13 20:13:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655000286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:30,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188594898] [2025-04-13 20:13:30,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:30,964 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:30,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:13:30,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:31,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:31,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:31,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:31,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:31,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:31,113 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:13:31,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:31,857 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:13:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188594898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:31,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:31,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552636376] [2025-04-13 20:13:31,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:31,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:31,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:31,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:31,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:31,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 218 transitions, 2090 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:31,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:31,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:31,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:32,541 INFO L116 PetriNetUnfolderBase]: 495/930 cut-off events. [2025-04-13 20:13:32,542 INFO L117 PetriNetUnfolderBase]: For 6992/6992 co-relation queries the response was YES. [2025-04-13 20:13:32,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 930 events. 495/930 cut-off events. For 6992/6992 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5002 event pairs, 43 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 5352. Up to 755 conditions per place. [2025-04-13 20:13:32,548 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 197 selfloop transitions, 63 changer transitions 8/268 dead transitions. [2025-04-13 20:13:32,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 268 transitions, 3124 flow [2025-04-13 20:13:32,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:13:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:13:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 127 transitions. [2025-04-13 20:13:32,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4150326797385621 [2025-04-13 20:13:32,550 INFO L175 Difference]: Start difference. First operand has 182 places, 218 transitions, 2090 flow. Second operand 18 states and 127 transitions. [2025-04-13 20:13:32,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 268 transitions, 3124 flow [2025-04-13 20:13:32,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 268 transitions, 2953 flow, removed 63 selfloop flow, removed 9 redundant places. [2025-04-13 20:13:32,581 INFO L231 Difference]: Finished difference. Result has 195 places, 229 transitions, 2402 flow [2025-04-13 20:13:32,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2402, PETRI_PLACES=195, PETRI_TRANSITIONS=229} [2025-04-13 20:13:32,582 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 176 predicate places. [2025-04-13 20:13:32,582 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 229 transitions, 2402 flow [2025-04-13 20:13:32,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:32,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:32,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:32,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:13:32,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:13:32,783 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:32,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -526293525, now seen corresponding path program 10 times [2025-04-13 20:13:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:32,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18083329] [2025-04-13 20:13:32,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:32,785 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:32,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:32,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:32,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:33,026 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:13:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:33,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18083329] [2025-04-13 20:13:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18083329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:33,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449740098] [2025-04-13 20:13:33,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:33,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:33,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:33,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:13:33,051 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:33,082 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:33,082 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:33,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:33,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:33,178 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:13:33,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:34,255 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:13:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449740098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:34,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279164112] [2025-04-13 20:13:34,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:34,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:34,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:34,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:34,256 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:34,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 229 transitions, 2402 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:34,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:34,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:34,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:34,704 INFO L116 PetriNetUnfolderBase]: 492/925 cut-off events. [2025-04-13 20:13:34,704 INFO L117 PetriNetUnfolderBase]: For 7886/7886 co-relation queries the response was YES. [2025-04-13 20:13:34,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 925 events. 492/925 cut-off events. For 7886/7886 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4960 event pairs, 44 based on Foata normal form. 2/903 useless extension candidates. Maximal degree in co-relation 5485. Up to 794 conditions per place. [2025-04-13 20:13:34,710 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 199 selfloop transitions, 57 changer transitions 8/264 dead transitions. [2025-04-13 20:13:34,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 264 transitions, 3110 flow [2025-04-13 20:13:34,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:13:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:13:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 126 transitions. [2025-04-13 20:13:34,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2025-04-13 20:13:34,711 INFO L175 Difference]: Start difference. First operand has 195 places, 229 transitions, 2402 flow. Second operand 20 states and 126 transitions. [2025-04-13 20:13:34,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 264 transitions, 3110 flow [2025-04-13 20:13:34,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 264 transitions, 2766 flow, removed 134 selfloop flow, removed 12 redundant places. [2025-04-13 20:13:34,743 INFO L231 Difference]: Finished difference. Result has 206 places, 233 transitions, 2301 flow [2025-04-13 20:13:34,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2301, PETRI_PLACES=206, PETRI_TRANSITIONS=233} [2025-04-13 20:13:34,745 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 187 predicate places. [2025-04-13 20:13:34,745 INFO L485 AbstractCegarLoop]: Abstraction has has 206 places, 233 transitions, 2301 flow [2025-04-13 20:13:34,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:34,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:34,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:34,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 20:13:34,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:13:34,946 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:34,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1194558391, now seen corresponding path program 11 times [2025-04-13 20:13:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:34,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122017664] [2025-04-13 20:13:34,946 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:34,948 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:34,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:34,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:35,191 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:13:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:35,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122017664] [2025-04-13 20:13:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122017664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:35,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673976704] [2025-04-13 20:13:35,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:35,193 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:35,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:13:35,224 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:35,281 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:35,281 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:35,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:35,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:35,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:35,448 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:13:35,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:36,032 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:13:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673976704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:36,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2025-04-13 20:13:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155470204] [2025-04-13 20:13:36,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:36,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:13:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:36,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:13:36,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:13:36,033 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:36,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 233 transitions, 2301 flow. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:36,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:36,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:36,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:36,510 INFO L116 PetriNetUnfolderBase]: 488/911 cut-off events. [2025-04-13 20:13:36,510 INFO L117 PetriNetUnfolderBase]: For 7055/7055 co-relation queries the response was YES. [2025-04-13 20:13:36,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 911 events. 488/911 cut-off events. For 7055/7055 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4848 event pairs, 41 based on Foata normal form. 2/889 useless extension candidates. Maximal degree in co-relation 5214. Up to 753 conditions per place. [2025-04-13 20:13:36,515 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 194 selfloop transitions, 63 changer transitions 8/265 dead transitions. [2025-04-13 20:13:36,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 265 transitions, 2989 flow [2025-04-13 20:13:36,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:13:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:13:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2025-04-13 20:13:36,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2025-04-13 20:13:36,516 INFO L175 Difference]: Start difference. First operand has 206 places, 233 transitions, 2301 flow. Second operand 18 states and 116 transitions. [2025-04-13 20:13:36,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 265 transitions, 2989 flow [2025-04-13 20:13:36,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 265 transitions, 2849 flow, removed 35 selfloop flow, removed 13 redundant places. [2025-04-13 20:13:36,537 INFO L231 Difference]: Finished difference. Result has 212 places, 235 transitions, 2400 flow [2025-04-13 20:13:36,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2400, PETRI_PLACES=212, PETRI_TRANSITIONS=235} [2025-04-13 20:13:36,538 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 193 predicate places. [2025-04-13 20:13:36,538 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 235 transitions, 2400 flow [2025-04-13 20:13:36,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:36,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:36,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:36,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:13:36,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:36,742 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:36,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash 679465585, now seen corresponding path program 12 times [2025-04-13 20:13:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:36,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207310385] [2025-04-13 20:13:36,742 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:36,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:36,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:36,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:36,912 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 20:13:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:36,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207310385] [2025-04-13 20:13:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207310385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:36,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389636] [2025-04-13 20:13:36,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:36,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:36,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:36,914 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:13:36,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:36,960 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:36,960 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:36,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:36,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:36,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:37,043 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 20:13:37,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:37,282 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 20:13:37,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389636] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:37,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:37,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 20:13:37,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752203847] [2025-04-13 20:13:37,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:37,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:13:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:37,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:13:37,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:13:37,283 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:37,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 235 transitions, 2400 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:37,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:37,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:37,995 INFO L116 PetriNetUnfolderBase]: 545/1024 cut-off events. [2025-04-13 20:13:37,995 INFO L117 PetriNetUnfolderBase]: For 9962/9962 co-relation queries the response was YES. [2025-04-13 20:13:37,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6208 conditions, 1024 events. 545/1024 cut-off events. For 9962/9962 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5655 event pairs, 38 based on Foata normal form. 3/1003 useless extension candidates. Maximal degree in co-relation 6108. Up to 801 conditions per place. [2025-04-13 20:13:38,001 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 219 selfloop transitions, 75 changer transitions 19/313 dead transitions. [2025-04-13 20:13:38,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 313 transitions, 3875 flow [2025-04-13 20:13:38,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:13:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:13:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. [2025-04-13 20:13:38,002 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40641711229946526 [2025-04-13 20:13:38,002 INFO L175 Difference]: Start difference. First operand has 212 places, 235 transitions, 2400 flow. Second operand 22 states and 152 transitions. [2025-04-13 20:13:38,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 313 transitions, 3875 flow [2025-04-13 20:13:38,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 313 transitions, 3718 flow, removed 34 selfloop flow, removed 14 redundant places. [2025-04-13 20:13:38,032 INFO L231 Difference]: Finished difference. Result has 220 places, 266 transitions, 2992 flow [2025-04-13 20:13:38,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2992, PETRI_PLACES=220, PETRI_TRANSITIONS=266} [2025-04-13 20:13:38,033 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 201 predicate places. [2025-04-13 20:13:38,033 INFO L485 AbstractCegarLoop]: Abstraction has has 220 places, 266 transitions, 2992 flow [2025-04-13 20:13:38,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:38,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:38,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:38,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:13:38,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:38,233 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:38,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash -866301411, now seen corresponding path program 13 times [2025-04-13 20:13:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:38,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315829907] [2025-04-13 20:13:38,234 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:38,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:13:38,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:38,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:38,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:38,456 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:13:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:38,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315829907] [2025-04-13 20:13:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315829907] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:38,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148103777] [2025-04-13 20:13:38,456 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:38,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:38,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:38,458 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:38,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:13:38,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:13:38,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:38,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:38,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:38,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:38,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:38,606 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:13:38,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:39,476 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:13:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148103777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:39,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002607671] [2025-04-13 20:13:39,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:39,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:39,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:39,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:39,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 266 transitions, 2992 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:39,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:39,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:39,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:40,012 INFO L116 PetriNetUnfolderBase]: 558/1039 cut-off events. [2025-04-13 20:13:40,012 INFO L117 PetriNetUnfolderBase]: For 10212/10212 co-relation queries the response was YES. [2025-04-13 20:13:40,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6598 conditions, 1039 events. 558/1039 cut-off events. For 10212/10212 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5716 event pairs, 39 based on Foata normal form. 2/1017 useless extension candidates. Maximal degree in co-relation 6496. Up to 890 conditions per place. [2025-04-13 20:13:40,020 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 246 selfloop transitions, 56 changer transitions 9/311 dead transitions. [2025-04-13 20:13:40,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 311 transitions, 4075 flow [2025-04-13 20:13:40,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 20:13:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 20:13:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 130 transitions. [2025-04-13 20:13:40,021 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3641456582633053 [2025-04-13 20:13:40,021 INFO L175 Difference]: Start difference. First operand has 220 places, 266 transitions, 2992 flow. Second operand 21 states and 130 transitions. [2025-04-13 20:13:40,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 311 transitions, 4075 flow [2025-04-13 20:13:40,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 311 transitions, 3627 flow, removed 212 selfloop flow, removed 9 redundant places. [2025-04-13 20:13:40,065 INFO L231 Difference]: Finished difference. Result has 234 places, 276 transitions, 2954 flow [2025-04-13 20:13:40,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2554, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2954, PETRI_PLACES=234, PETRI_TRANSITIONS=276} [2025-04-13 20:13:40,065 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 215 predicate places. [2025-04-13 20:13:40,066 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 276 transitions, 2954 flow [2025-04-13 20:13:40,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:40,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:40,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:40,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:40,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 20:13:40,266 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:40,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash 887830237, now seen corresponding path program 14 times [2025-04-13 20:13:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:40,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539081256] [2025-04-13 20:13:40,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:40,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:40,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:40,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:40,464 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 20:13:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:40,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539081256] [2025-04-13 20:13:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539081256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:40,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163789340] [2025-04-13 20:13:40,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:40,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:40,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:40,467 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:40,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:13:40,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:40,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:40,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:40,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:40,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:40,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:40,609 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 20:13:40,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:40,833 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 20:13:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163789340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:40,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 20:13:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465114044] [2025-04-13 20:13:40,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:40,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:13:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:40,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:13:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:13:40,835 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:40,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 276 transitions, 2954 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:40,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:40,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:40,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:41,486 INFO L116 PetriNetUnfolderBase]: 561/1048 cut-off events. [2025-04-13 20:13:41,486 INFO L117 PetriNetUnfolderBase]: For 9171/9171 co-relation queries the response was YES. [2025-04-13 20:13:41,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6489 conditions, 1048 events. 561/1048 cut-off events. For 9171/9171 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5804 event pairs, 38 based on Foata normal form. 3/1018 useless extension candidates. Maximal degree in co-relation 6386. Up to 858 conditions per place. [2025-04-13 20:13:41,493 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 237 selfloop transitions, 72 changer transitions 15/324 dead transitions. [2025-04-13 20:13:41,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 324 transitions, 3931 flow [2025-04-13 20:13:41,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:13:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:13:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 146 transitions. [2025-04-13 20:13:41,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3734015345268542 [2025-04-13 20:13:41,494 INFO L175 Difference]: Start difference. First operand has 234 places, 276 transitions, 2954 flow. Second operand 23 states and 146 transitions. [2025-04-13 20:13:41,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 324 transitions, 3931 flow [2025-04-13 20:13:41,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 324 transitions, 3702 flow, removed 74 selfloop flow, removed 20 redundant places. [2025-04-13 20:13:41,535 INFO L231 Difference]: Finished difference. Result has 242 places, 281 transitions, 3012 flow [2025-04-13 20:13:41,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2731, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3012, PETRI_PLACES=242, PETRI_TRANSITIONS=281} [2025-04-13 20:13:41,535 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 223 predicate places. [2025-04-13 20:13:41,535 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 281 transitions, 3012 flow [2025-04-13 20:13:41,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:41,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:41,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:41,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:13:41,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 20:13:41,736 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:41,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1689379943, now seen corresponding path program 15 times [2025-04-13 20:13:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:41,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036506537] [2025-04-13 20:13:41,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:41,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:41,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:41,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:41,921 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 20:13:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:41,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036506537] [2025-04-13 20:13:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036506537] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:41,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493367270] [2025-04-13 20:13:41,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:41,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:41,923 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:41,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:13:41,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:41,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:41,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:41,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:41,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:41,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:42,081 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 20:13:42,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:42,312 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 20:13:42,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493367270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:42,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:42,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 20:13:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969286240] [2025-04-13 20:13:42,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:42,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:13:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:42,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:13:42,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:13:42,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:42,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 281 transitions, 3012 flow. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:42,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:42,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:42,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:44,170 INFO L116 PetriNetUnfolderBase]: 596/1118 cut-off events. [2025-04-13 20:13:44,170 INFO L117 PetriNetUnfolderBase]: For 14169/14169 co-relation queries the response was YES. [2025-04-13 20:13:44,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7372 conditions, 1118 events. 596/1118 cut-off events. For 14169/14169 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6314 event pairs, 42 based on Foata normal form. 3/1091 useless extension candidates. Maximal degree in co-relation 7265. Up to 850 conditions per place. [2025-04-13 20:13:44,180 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 234 selfloop transitions, 100 changer transitions 13/347 dead transitions. [2025-04-13 20:13:44,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 347 transitions, 4460 flow [2025-04-13 20:13:44,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 20:13:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 20:13:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 178 transitions. [2025-04-13 20:13:44,181 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3877995642701525 [2025-04-13 20:13:44,181 INFO L175 Difference]: Start difference. First operand has 242 places, 281 transitions, 3012 flow. Second operand 27 states and 178 transitions. [2025-04-13 20:13:44,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 347 transitions, 4460 flow [2025-04-13 20:13:44,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 347 transitions, 4281 flow, removed 55 selfloop flow, removed 15 redundant places. [2025-04-13 20:13:44,237 INFO L231 Difference]: Finished difference. Result has 253 places, 296 transitions, 3500 flow [2025-04-13 20:13:44,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2851, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3500, PETRI_PLACES=253, PETRI_TRANSITIONS=296} [2025-04-13 20:13:44,238 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 234 predicate places. [2025-04-13 20:13:44,238 INFO L485 AbstractCegarLoop]: Abstraction has has 253 places, 296 transitions, 3500 flow [2025-04-13 20:13:44,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:44,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:44,238 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:44,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:13:44,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:44,439 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:44,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 854169288, now seen corresponding path program 16 times [2025-04-13 20:13:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:44,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042784447] [2025-04-13 20:13:44,439 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:44,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:44,447 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:44,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:44,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:44,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042784447] [2025-04-13 20:13:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042784447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:44,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286481033] [2025-04-13 20:13:44,991 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:44,993 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:44,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:13:45,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:45,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:45,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:45,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:45,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:13:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:45,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286481033] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:45,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 20:13:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810131518] [2025-04-13 20:13:45,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:45,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:13:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:45,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:13:45,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:13:45,526 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:45,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 296 transitions, 3500 flow. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:45,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:45,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:45,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:47,470 INFO L116 PetriNetUnfolderBase]: 667/1263 cut-off events. [2025-04-13 20:13:47,471 INFO L117 PetriNetUnfolderBase]: For 22079/22079 co-relation queries the response was YES. [2025-04-13 20:13:47,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9406 conditions, 1263 events. 667/1263 cut-off events. For 22079/22079 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7363 event pairs, 39 based on Foata normal form. 6/1239 useless extension candidates. Maximal degree in co-relation 9298. Up to 868 conditions per place. [2025-04-13 20:13:47,478 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 242 selfloop transitions, 136 changer transitions 16/394 dead transitions. [2025-04-13 20:13:47,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 394 transitions, 5901 flow [2025-04-13 20:13:47,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 20:13:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 20:13:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 220 transitions. [2025-04-13 20:13:47,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-04-13 20:13:47,480 INFO L175 Difference]: Start difference. First operand has 253 places, 296 transitions, 3500 flow. Second operand 33 states and 220 transitions. [2025-04-13 20:13:47,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 394 transitions, 5901 flow [2025-04-13 20:13:47,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 394 transitions, 5163 flow, removed 336 selfloop flow, removed 11 redundant places. [2025-04-13 20:13:47,570 INFO L231 Difference]: Finished difference. Result has 279 places, 329 transitions, 4371 flow [2025-04-13 20:13:47,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3135, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4371, PETRI_PLACES=279, PETRI_TRANSITIONS=329} [2025-04-13 20:13:47,573 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 260 predicate places. [2025-04-13 20:13:47,573 INFO L485 AbstractCegarLoop]: Abstraction has has 279 places, 329 transitions, 4371 flow [2025-04-13 20:13:47,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:47,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:47,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:47,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 20:13:47,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:47,774 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:47,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1710322179, now seen corresponding path program 17 times [2025-04-13 20:13:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:47,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600701623] [2025-04-13 20:13:47,774 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:47,777 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:47,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:47,781 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:47,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:48,070 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:13:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:48,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600701623] [2025-04-13 20:13:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600701623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:48,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595542739] [2025-04-13 20:13:48,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:48,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:48,072 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:48,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:13:48,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:48,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:48,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:48,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:48,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:48,231 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:13:48,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:48,903 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:13:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595542739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:48,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 20:13:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572679004] [2025-04-13 20:13:48,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:48,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:13:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:48,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:13:48,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:13:48,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:48,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 329 transitions, 4371 flow. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:48,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:48,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:48,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:49,668 INFO L116 PetriNetUnfolderBase]: 695/1310 cut-off events. [2025-04-13 20:13:49,668 INFO L117 PetriNetUnfolderBase]: For 24140/24140 co-relation queries the response was YES. [2025-04-13 20:13:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10070 conditions, 1310 events. 695/1310 cut-off events. For 24140/24140 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 7671 event pairs, 45 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 9953. Up to 1160 conditions per place. [2025-04-13 20:13:49,677 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 319 selfloop transitions, 57 changer transitions 7/383 dead transitions. [2025-04-13 20:13:49,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 383 transitions, 6078 flow [2025-04-13 20:13:49,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:13:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:13:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2025-04-13 20:13:49,681 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39628482972136225 [2025-04-13 20:13:49,681 INFO L175 Difference]: Start difference. First operand has 279 places, 329 transitions, 4371 flow. Second operand 19 states and 128 transitions. [2025-04-13 20:13:49,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 383 transitions, 6078 flow [2025-04-13 20:13:49,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 383 transitions, 5301 flow, removed 332 selfloop flow, removed 20 redundant places. [2025-04-13 20:13:49,804 INFO L231 Difference]: Finished difference. Result has 281 places, 345 transitions, 4358 flow [2025-04-13 20:13:49,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4358, PETRI_PLACES=281, PETRI_TRANSITIONS=345} [2025-04-13 20:13:49,805 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 262 predicate places. [2025-04-13 20:13:49,805 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 345 transitions, 4358 flow [2025-04-13 20:13:49,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:49,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:49,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:49,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:13:50,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 20:13:50,006 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:50,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash -868809621, now seen corresponding path program 18 times [2025-04-13 20:13:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:50,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046513030] [2025-04-13 20:13:50,007 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:50,009 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:50,013 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:50,013 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:50,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:50,271 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:13:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:50,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046513030] [2025-04-13 20:13:50,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046513030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:50,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922888029] [2025-04-13 20:13:50,272 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:50,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:50,273 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:50,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:13:50,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:50,312 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:50,312 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:50,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:50,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:50,410 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:13:50,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:51,070 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:13:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922888029] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:51,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083982263] [2025-04-13 20:13:51,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:51,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:51,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:51,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:51,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:51,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 345 transitions, 4358 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:51,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:51,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:51,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:51,773 INFO L116 PetriNetUnfolderBase]: 694/1312 cut-off events. [2025-04-13 20:13:51,774 INFO L117 PetriNetUnfolderBase]: For 21383/21383 co-relation queries the response was YES. [2025-04-13 20:13:51,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 1312 events. 694/1312 cut-off events. For 21383/21383 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 7718 event pairs, 44 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 9263. Up to 1167 conditions per place. [2025-04-13 20:13:51,783 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 318 selfloop transitions, 56 changer transitions 8/382 dead transitions. [2025-04-13 20:13:51,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 382 transitions, 5403 flow [2025-04-13 20:13:51,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:13:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:13:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2025-04-13 20:13:51,785 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4024767801857585 [2025-04-13 20:13:51,785 INFO L175 Difference]: Start difference. First operand has 281 places, 345 transitions, 4358 flow. Second operand 19 states and 130 transitions. [2025-04-13 20:13:51,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 382 transitions, 5403 flow [2025-04-13 20:13:51,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 382 transitions, 4908 flow, removed 230 selfloop flow, removed 9 redundant places. [2025-04-13 20:13:51,898 INFO L231 Difference]: Finished difference. Result has 292 places, 348 transitions, 4150 flow [2025-04-13 20:13:51,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3863, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4150, PETRI_PLACES=292, PETRI_TRANSITIONS=348} [2025-04-13 20:13:51,899 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 273 predicate places. [2025-04-13 20:13:51,899 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 348 transitions, 4150 flow [2025-04-13 20:13:51,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:51,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:51,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:51,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:13:52,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:13:52,100 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:52,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1707813969, now seen corresponding path program 19 times [2025-04-13 20:13:52,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:52,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297426549] [2025-04-13 20:13:52,100 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:52,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:52,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:13:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:52,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:52,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:52,315 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:13:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:52,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297426549] [2025-04-13 20:13:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297426549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:52,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172219027] [2025-04-13 20:13:52,315 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:52,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:52,317 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:52,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:13:52,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:13:52,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:52,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:52,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:52,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:52,450 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:13:52,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:53,015 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:13:53,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172219027] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:53,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:53,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:13:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662462074] [2025-04-13 20:13:53,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:53,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:13:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:53,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:13:53,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:13:53,017 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:53,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 348 transitions, 4150 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:53,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:53,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:53,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:53,503 INFO L116 PetriNetUnfolderBase]: 687/1295 cut-off events. [2025-04-13 20:13:53,503 INFO L117 PetriNetUnfolderBase]: For 19387/19387 co-relation queries the response was YES. [2025-04-13 20:13:53,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8886 conditions, 1295 events. 687/1295 cut-off events. For 19387/19387 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7539 event pairs, 47 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 8793. Up to 1159 conditions per place. [2025-04-13 20:13:53,530 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 312 selfloop transitions, 57 changer transitions 8/377 dead transitions. [2025-04-13 20:13:53,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 377 transitions, 5103 flow [2025-04-13 20:13:53,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:13:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:13:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2025-04-13 20:13:53,531 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3771626297577855 [2025-04-13 20:13:53,531 INFO L175 Difference]: Start difference. First operand has 292 places, 348 transitions, 4150 flow. Second operand 17 states and 109 transitions. [2025-04-13 20:13:53,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 377 transitions, 5103 flow [2025-04-13 20:13:53,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 377 transitions, 4836 flow, removed 99 selfloop flow, removed 16 redundant places. [2025-04-13 20:13:53,624 INFO L231 Difference]: Finished difference. Result has 295 places, 350 transitions, 4147 flow [2025-04-13 20:13:53,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3885, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4147, PETRI_PLACES=295, PETRI_TRANSITIONS=350} [2025-04-13 20:13:53,625 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 276 predicate places. [2025-04-13 20:13:53,625 INFO L485 AbstractCegarLoop]: Abstraction has has 295 places, 350 transitions, 4147 flow [2025-04-13 20:13:53,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:53,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:53,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:53,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:13:53,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:13:53,826 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:53,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1765733439, now seen corresponding path program 20 times [2025-04-13 20:13:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:53,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528423953] [2025-04-13 20:13:53,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:53,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:53,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:53,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:53,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:54,009 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 20:13:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:54,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528423953] [2025-04-13 20:13:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528423953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:54,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917598881] [2025-04-13 20:13:54,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:54,011 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:54,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:13:54,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 20:13:54,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:13:54,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:54,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:54,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:13:54,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:54,174 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 20:13:54,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:54,715 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 20:13:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917598881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:54,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 20:13:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304027587] [2025-04-13 20:13:54,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:54,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:13:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:54,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:13:54,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:13:54,716 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:54,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 350 transitions, 4147 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:54,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:54,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:54,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:55,194 INFO L116 PetriNetUnfolderBase]: 689/1307 cut-off events. [2025-04-13 20:13:55,194 INFO L117 PetriNetUnfolderBase]: For 19440/19440 co-relation queries the response was YES. [2025-04-13 20:13:55,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9108 conditions, 1307 events. 689/1307 cut-off events. For 19440/19440 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 7698 event pairs, 49 based on Foata normal form. 3/1282 useless extension candidates. Maximal degree in co-relation 8982. Up to 1221 conditions per place. [2025-04-13 20:13:55,204 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 332 selfloop transitions, 39 changer transitions 7/378 dead transitions. [2025-04-13 20:13:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 378 transitions, 5266 flow [2025-04-13 20:13:55,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:13:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:13:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 100 transitions. [2025-04-13 20:13:55,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-04-13 20:13:55,205 INFO L175 Difference]: Start difference. First operand has 295 places, 350 transitions, 4147 flow. Second operand 16 states and 100 transitions. [2025-04-13 20:13:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 378 transitions, 5266 flow [2025-04-13 20:13:55,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 378 transitions, 5005 flow, removed 88 selfloop flow, removed 13 redundant places. [2025-04-13 20:13:55,317 INFO L231 Difference]: Finished difference. Result has 298 places, 353 transitions, 4173 flow [2025-04-13 20:13:55,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3986, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4173, PETRI_PLACES=298, PETRI_TRANSITIONS=353} [2025-04-13 20:13:55,317 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 279 predicate places. [2025-04-13 20:13:55,318 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 353 transitions, 4173 flow [2025-04-13 20:13:55,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:55,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:55,318 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:55,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 20:13:55,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:13:55,521 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:55,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash 172942881, now seen corresponding path program 5 times [2025-04-13 20:13:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:55,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262486797] [2025-04-13 20:13:55,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:55,523 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:55,527 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:55,527 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:55,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:55,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:55,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262486797] [2025-04-13 20:13:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262486797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:55,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081128508] [2025-04-13 20:13:55,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:55,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:55,605 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:55,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:13:55,625 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:55,638 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:55,638 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:13:55,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:55,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:13:55,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:55,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081128508] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:55,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2025-04-13 20:13:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28580013] [2025-04-13 20:13:55,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:55,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:13:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:55,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:13:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:13:55,949 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:55,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 353 transitions, 4173 flow. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:55,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:55,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:55,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:56,755 INFO L116 PetriNetUnfolderBase]: 786/1463 cut-off events. [2025-04-13 20:13:56,756 INFO L117 PetriNetUnfolderBase]: For 26249/26249 co-relation queries the response was YES. [2025-04-13 20:13:56,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10504 conditions, 1463 events. 786/1463 cut-off events. For 26249/26249 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 8742 event pairs, 11 based on Foata normal form. 3/1438 useless extension candidates. Maximal degree in co-relation 10406. Up to 561 conditions per place. [2025-04-13 20:13:56,767 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 201 selfloop transitions, 254 changer transitions 12/467 dead transitions. [2025-04-13 20:13:56,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 467 transitions, 6450 flow [2025-04-13 20:13:56,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 20:13:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 20:13:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 196 transitions. [2025-04-13 20:13:56,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3975659229208925 [2025-04-13 20:13:56,768 INFO L175 Difference]: Start difference. First operand has 298 places, 353 transitions, 4173 flow. Second operand 29 states and 196 transitions. [2025-04-13 20:13:56,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 467 transitions, 6450 flow [2025-04-13 20:13:56,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 467 transitions, 6280 flow, removed 55 selfloop flow, removed 12 redundant places. [2025-04-13 20:13:56,904 INFO L231 Difference]: Finished difference. Result has 318 places, 396 transitions, 5788 flow [2025-04-13 20:13:56,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4025, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5788, PETRI_PLACES=318, PETRI_TRANSITIONS=396} [2025-04-13 20:13:56,905 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 299 predicate places. [2025-04-13 20:13:56,905 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 396 transitions, 5788 flow [2025-04-13 20:13:56,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:56,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:56,905 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:56,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 20:13:57,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:13:57,106 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:57,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -790397691, now seen corresponding path program 6 times [2025-04-13 20:13:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:57,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321108851] [2025-04-13 20:13:57,106 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:57,108 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:57,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:57,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:57,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321108851] [2025-04-13 20:13:57,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321108851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:57,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565926921] [2025-04-13 20:13:57,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:57,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:57,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:57,215 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:57,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:13:57,236 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:57,252 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:57,252 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:13:57,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:57,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:13:57,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:57,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565926921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:57,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:57,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 13 [2025-04-13 20:13:57,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578350496] [2025-04-13 20:13:57,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:57,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:13:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:57,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:13:57,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:13:57,430 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:57,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 396 transitions, 5788 flow. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:57,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:57,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:57,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:58,262 INFO L116 PetriNetUnfolderBase]: 803/1498 cut-off events. [2025-04-13 20:13:58,262 INFO L117 PetriNetUnfolderBase]: For 34287/34287 co-relation queries the response was YES. [2025-04-13 20:13:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12221 conditions, 1498 events. 803/1498 cut-off events. For 34287/34287 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 8994 event pairs, 29 based on Foata normal form. 4/1498 useless extension candidates. Maximal degree in co-relation 12075. Up to 1159 conditions per place. [2025-04-13 20:13:58,272 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 357 selfloop transitions, 81 changer transitions 7/445 dead transitions. [2025-04-13 20:13:58,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 445 transitions, 7413 flow [2025-04-13 20:13:58,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:13:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:13:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2025-04-13 20:13:58,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2025-04-13 20:13:58,273 INFO L175 Difference]: Start difference. First operand has 318 places, 396 transitions, 5788 flow. Second operand 15 states and 108 transitions. [2025-04-13 20:13:58,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 445 transitions, 7413 flow [2025-04-13 20:13:58,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 445 transitions, 6942 flow, removed 163 selfloop flow, removed 21 redundant places. [2025-04-13 20:13:58,485 INFO L231 Difference]: Finished difference. Result has 314 places, 405 transitions, 5905 flow [2025-04-13 20:13:58,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5403, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5905, PETRI_PLACES=314, PETRI_TRANSITIONS=405} [2025-04-13 20:13:58,486 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 295 predicate places. [2025-04-13 20:13:58,486 INFO L485 AbstractCegarLoop]: Abstraction has has 314 places, 405 transitions, 5905 flow [2025-04-13 20:13:58,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:13:58,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:58,486 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:58,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:13:58,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:58,687 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:13:58,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash -682592605, now seen corresponding path program 21 times [2025-04-13 20:13:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:58,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490128154] [2025-04-13 20:13:58,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:58,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:58,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:58,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:58,978 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:13:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:58,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490128154] [2025-04-13 20:13:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490128154] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:58,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259449395] [2025-04-13 20:13:58,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:58,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:58,980 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:13:58,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 20:13:59,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:13:59,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:13:59,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:13:59,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:59,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:13:59,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:13:59,217 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:13:59,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:59,503 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:13:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259449395] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:13:59,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:13:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 20:13:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52900149] [2025-04-13 20:13:59,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:13:59,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:13:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:59,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:13:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:13:59,504 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:13:59,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 405 transitions, 5905 flow. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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 20:13:59,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:59,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:13:59,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:00,974 INFO L116 PetriNetUnfolderBase]: 813/1523 cut-off events. [2025-04-13 20:14:00,975 INFO L117 PetriNetUnfolderBase]: For 30302/30302 co-relation queries the response was YES. [2025-04-13 20:14:00,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12250 conditions, 1523 events. 813/1523 cut-off events. For 30302/30302 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 9229 event pairs, 32 based on Foata normal form. 4/1525 useless extension candidates. Maximal degree in co-relation 12084. Up to 1215 conditions per place. [2025-04-13 20:14:00,985 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 339 selfloop transitions, 116 changer transitions 12/467 dead transitions. [2025-04-13 20:14:00,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 467 transitions, 7182 flow [2025-04-13 20:14:00,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 20:14:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 20:14:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 198 transitions. [2025-04-13 20:14:00,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2025-04-13 20:14:00,987 INFO L175 Difference]: Start difference. First operand has 314 places, 405 transitions, 5905 flow. Second operand 30 states and 198 transitions. [2025-04-13 20:14:00,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 467 transitions, 7182 flow [2025-04-13 20:14:01,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 467 transitions, 7031 flow, removed 55 selfloop flow, removed 8 redundant places. [2025-04-13 20:14:01,179 INFO L231 Difference]: Finished difference. Result has 338 places, 407 transitions, 6092 flow [2025-04-13 20:14:01,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5761, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6092, PETRI_PLACES=338, PETRI_TRANSITIONS=407} [2025-04-13 20:14:01,180 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 319 predicate places. [2025-04-13 20:14:01,180 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 407 transitions, 6092 flow [2025-04-13 20:14:01,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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 20:14:01,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:01,180 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:01,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 20:14:01,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-13 20:14:01,381 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:01,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -734986431, now seen corresponding path program 7 times [2025-04-13 20:14:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:01,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773261486] [2025-04-13 20:14:01,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:14:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:01,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:14:01,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:01,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:01,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:01,462 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:14:01,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:01,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773261486] [2025-04-13 20:14:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773261486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:01,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543146618] [2025-04-13 20:14:01,462 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:14:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:01,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:01,464 INFO L229 MonitoredProcess]: Starting monitored process 32 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:14:01,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 20:14:01,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:14:01,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:01,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:01,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:01,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 20:14:01,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:01,585 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:14:01,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:01,702 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:14:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543146618] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:01,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-04-13 20:14:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260464874] [2025-04-13 20:14:01,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:01,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:14:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:01,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:14:01,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:14:01,703 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:14:01,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 407 transitions, 6092 flow. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:01,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:01,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:14:01,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:03,512 INFO L116 PetriNetUnfolderBase]: 808/1515 cut-off events. [2025-04-13 20:14:03,512 INFO L117 PetriNetUnfolderBase]: For 27781/27781 co-relation queries the response was YES. [2025-04-13 20:14:03,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12224 conditions, 1515 events. 808/1515 cut-off events. For 27781/27781 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 9160 event pairs, 25 based on Foata normal form. 6/1519 useless extension candidates. Maximal degree in co-relation 12055. Up to 1160 conditions per place. [2025-04-13 20:14:03,526 INFO L140 encePairwiseOnDemand]: 10/17 looper letters, 342 selfloop transitions, 56 changer transitions 57/455 dead transitions. [2025-04-13 20:14:03,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 455 transitions, 7577 flow [2025-04-13 20:14:03,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:14:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:14:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 116 transitions. [2025-04-13 20:14:03,527 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4013840830449827 [2025-04-13 20:14:03,527 INFO L175 Difference]: Start difference. First operand has 338 places, 407 transitions, 6092 flow. Second operand 17 states and 116 transitions. [2025-04-13 20:14:03,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 455 transitions, 7577 flow [2025-04-13 20:14:03,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 455 transitions, 7316 flow, removed 47 selfloop flow, removed 24 redundant places. [2025-04-13 20:14:03,700 INFO L231 Difference]: Finished difference. Result has 331 places, 374 transitions, 5472 flow [2025-04-13 20:14:03,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5831, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5472, PETRI_PLACES=331, PETRI_TRANSITIONS=374} [2025-04-13 20:14:03,701 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 312 predicate places. [2025-04-13 20:14:03,701 INFO L485 AbstractCegarLoop]: Abstraction has has 331 places, 374 transitions, 5472 flow [2025-04-13 20:14:03,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:03,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:03,701 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:03,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 20:14:03,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:03,901 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:03,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1447831245, now seen corresponding path program 22 times [2025-04-13 20:14:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:03,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345433503] [2025-04-13 20:14:03,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:03,904 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:14:03,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:03,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:03,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:04,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345433503] [2025-04-13 20:14:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345433503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:04,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804361056] [2025-04-13 20:14:04,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:04,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:04,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:04,362 INFO L229 MonitoredProcess]: Starting monitored process 33 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:14:04,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 20:14:04,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:14:04,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:04,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:04,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:04,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:14:04,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:04,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804361056] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:06,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:06,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 20:14:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277220447] [2025-04-13 20:14:06,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:06,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:14:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:06,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:14:06,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:14:06,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:14:06,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 374 transitions, 5472 flow. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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 20:14:06,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:06,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:14:06,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:08,147 INFO L116 PetriNetUnfolderBase]: 743/1374 cut-off events. [2025-04-13 20:14:08,147 INFO L117 PetriNetUnfolderBase]: For 23926/23926 co-relation queries the response was YES. [2025-04-13 20:14:08,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11071 conditions, 1374 events. 743/1374 cut-off events. For 23926/23926 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8008 event pairs, 25 based on Foata normal form. 3/1375 useless extension candidates. Maximal degree in co-relation 10936. Up to 1151 conditions per place. [2025-04-13 20:14:08,155 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 339 selfloop transitions, 76 changer transitions 12/427 dead transitions. [2025-04-13 20:14:08,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 427 transitions, 6680 flow [2025-04-13 20:14:08,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:14:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:14:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 154 transitions. [2025-04-13 20:14:08,156 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37745098039215685 [2025-04-13 20:14:08,157 INFO L175 Difference]: Start difference. First operand has 331 places, 374 transitions, 5472 flow. Second operand 24 states and 154 transitions. [2025-04-13 20:14:08,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 427 transitions, 6680 flow [2025-04-13 20:14:08,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 427 transitions, 6344 flow, removed 87 selfloop flow, removed 23 redundant places. [2025-04-13 20:14:08,300 INFO L231 Difference]: Finished difference. Result has 316 places, 378 transitions, 5443 flow [2025-04-13 20:14:08,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5136, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5443, PETRI_PLACES=316, PETRI_TRANSITIONS=378} [2025-04-13 20:14:08,300 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 297 predicate places. [2025-04-13 20:14:08,300 INFO L485 AbstractCegarLoop]: Abstraction has has 316 places, 378 transitions, 5443 flow [2025-04-13 20:14:08,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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 20:14:08,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:08,301 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:08,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:14:08,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:08,505 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:08,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1927524612, now seen corresponding path program 23 times [2025-04-13 20:14:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:08,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164169046] [2025-04-13 20:14:08,506 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:14:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:08,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:14:08,512 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:08,512 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:14:08,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:08,767 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:14:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:08,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164169046] [2025-04-13 20:14:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164169046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:08,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891961550] [2025-04-13 20:14:08,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:14:08,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:08,769 INFO L229 MonitoredProcess]: Starting monitored process 34 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:14:08,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 20:14:08,789 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:14:08,804 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:08,804 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:14:08,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:08,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:14:08,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:09,579 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:14:09,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:14,068 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:14:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891961550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:14,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 20:14:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380333193] [2025-04-13 20:14:14,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:14,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:14:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:14,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:14:14,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=382, Unknown=1, NotChecked=0, Total=462 [2025-04-13 20:14:14,069 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:14:14,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 378 transitions, 5443 flow. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:14,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:14,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:14:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:18,239 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:14:22,677 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:14:27,026 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:14:31,077 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:14:39,685 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:14:39,927 INFO L116 PetriNetUnfolderBase]: 752/1389 cut-off events. [2025-04-13 20:14:39,928 INFO L117 PetriNetUnfolderBase]: For 25139/25139 co-relation queries the response was YES. [2025-04-13 20:14:39,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11058 conditions, 1389 events. 752/1389 cut-off events. For 25139/25139 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8139 event pairs, 46 based on Foata normal form. 2/1389 useless extension candidates. Maximal degree in co-relation 10908. Up to 1240 conditions per place. [2025-04-13 20:14:39,938 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 332 selfloop transitions, 85 changer transitions 7/424 dead transitions. [2025-04-13 20:14:39,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 424 transitions, 6683 flow [2025-04-13 20:14:39,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:14:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:14:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 160 transitions. [2025-04-13 20:14:39,939 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2025-04-13 20:14:39,939 INFO L175 Difference]: Start difference. First operand has 316 places, 378 transitions, 5443 flow. Second operand 25 states and 160 transitions. [2025-04-13 20:14:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 424 transitions, 6683 flow [2025-04-13 20:14:40,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 424 transitions, 6449 flow, removed 66 selfloop flow, removed 21 redundant places. [2025-04-13 20:14:40,083 INFO L231 Difference]: Finished difference. Result has 322 places, 386 transitions, 5619 flow [2025-04-13 20:14:40,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5217, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5619, PETRI_PLACES=322, PETRI_TRANSITIONS=386} [2025-04-13 20:14:40,083 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 303 predicate places. [2025-04-13 20:14:40,084 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 386 transitions, 5619 flow [2025-04-13 20:14:40,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:40,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:40,084 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:40,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 20:14:40,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 20:14:40,284 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:40,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash -658800284, now seen corresponding path program 4 times [2025-04-13 20:14:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:40,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303802369] [2025-04-13 20:14:40,285 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:40,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:40,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:14:40,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:40,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:40,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303802369] [2025-04-13 20:14:40,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303802369] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:40,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492526165] [2025-04-13 20:14:40,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:40,431 INFO L229 MonitoredProcess]: Starting monitored process 35 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:14:40,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 20:14:40,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:14:40,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:14:40,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:40,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:40,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 20:14:40,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:40,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:53,430 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse2 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse0 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse3 (+ .cse5 v_z_369))) (or (< .cse0 0) (< .cse1 .cse0) (= .cse2 .cse3) (< v_z_369 0) (< 4294967295 v_z_369) (= .cse4 .cse3)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse6 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse7 (+ .cse5 v_z_369))) (or (< .cse6 0) (< .cse1 .cse6) (< .cse7 4294967296) (< 4294967295 v_z_369) (= .cse4 .cse7)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse8 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse9 (+ .cse5 v_z_369))) (or (< .cse8 0) (< .cse1 .cse8) (= .cse2 .cse9) (< v_z_369 0) (< 4294967295 .cse9))))))) is different from false [2025-04-13 20:15:01,461 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:15:21,502 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:15:34,428 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse3 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse0 (+ .cse2 v_z_369))) (or (< .cse0 4294967296) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< 4294967295 v_z_369) (= .cse1 .cse0)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse4 (+ .cse2 v_z_369))) (or (= .cse3 .cse4) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< v_z_369 0) (< 4294967295 .cse4)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse5 (+ .cse2 v_z_369))) (or (= .cse3 .cse5) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< v_z_369 0) (< 4294967295 v_z_369) (= .cse1 .cse5))))))) is different from false [2025-04-13 20:15:38,446 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse3 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse0 (+ .cse2 v_z_369))) (or (< .cse0 4294967296) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< 4294967295 v_z_369) (= .cse1 .cse0)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse4 (+ .cse2 v_z_369))) (or (= .cse3 .cse4) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< v_z_369 0) (< 4294967295 .cse4)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse5 (+ .cse2 v_z_369))) (or (= .cse3 .cse5) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< v_z_369 0) (< 4294967295 v_z_369) (= .cse1 .cse5))))))) is different from true [2025-04-13 20:16:02,533 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:16:26,625 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:16:46,667 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:16:58,908 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:17:15,644 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:17:35,691 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:18:15,931 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:18:32,016 WARN L286 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:18:44,051 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:18:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492526165] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:18:48,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:18:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-13 20:18:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192668313] [2025-04-13 20:18:48,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:18:48,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:18:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:18:48,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=174, Unknown=5, NotChecked=58, Total=306 [2025-04-13 20:18:48,059 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:18:48,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 386 transitions, 5619 flow. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:18:48,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:48,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:18:48,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:52,193 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse3 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse0 (+ .cse2 v_z_369))) (or (< .cse0 4294967296) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< 4294967295 v_z_369) (= .cse1 .cse0)))) (= c_~x_2~0 0) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse4 (+ .cse2 v_z_369))) (or (= .cse3 .cse4) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< v_z_369 0) (< 4294967295 .cse4)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse5 (+ .cse2 v_z_369))) (or (= .cse3 .cse5) (not (= (+ (* v_y_369 4294967296) (* 2863311531 v_z_369)) 0)) (< v_z_369 0) (< 4294967295 v_z_369) (= .cse1 .cse5)))) (= c_~x_1~0 0)))) is different from false [2025-04-13 20:18:56,265 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse2 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (<= 0 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse0 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse3 (+ .cse5 v_z_369))) (or (< .cse0 0) (< .cse1 .cse0) (= .cse2 .cse3) (< v_z_369 0) (< 4294967295 v_z_369) (= .cse4 .cse3)))) (<= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse6 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse7 (+ .cse5 v_z_369))) (or (< .cse6 0) (< .cse1 .cse6) (< .cse7 4294967296) (< 4294967295 v_z_369) (= .cse4 .cse7)))) (= c_~x_2~0 0) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse8 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse9 (+ .cse5 v_z_369))) (or (< .cse8 0) (< .cse1 .cse8) (= .cse2 .cse9) (< v_z_369 0) (< 4294967295 .cse9)))) (= c_~x_1~0 0)))) is different from false [2025-04-13 20:19:00,517 WARN L849 $PredicateComparison]: unable to prove that (and (<= 0 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (<= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_2~0 0) (or (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse2 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse0 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse3 (+ .cse5 v_z_369))) (or (< .cse0 0) (< .cse1 .cse0) (= .cse2 .cse3) (< v_z_369 0) (< 4294967295 v_z_369) (= .cse4 .cse3)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse6 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse7 (+ .cse5 v_z_369))) (or (< .cse6 0) (< .cse1 .cse6) (< .cse7 4294967296) (< 4294967295 v_z_369) (= .cse4 .cse7)))) (forall ((v_z_369 Int) (v_y_369 Int)) (let ((.cse8 (+ (* v_y_369 4294967296) (* 2863311531 v_z_369))) (.cse9 (+ .cse5 v_z_369))) (or (< .cse8 0) (< .cse1 .cse8) (= .cse2 .cse9) (< v_z_369 0) (< 4294967295 .cse9))))))) (< 4294967294 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296))) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0)) is different from false [2025-04-13 20:19:02,787 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:19:03,796 INFO L116 PetriNetUnfolderBase]: 811/1497 cut-off events. [2025-04-13 20:19:03,796 INFO L117 PetriNetUnfolderBase]: For 27250/27250 co-relation queries the response was YES. [2025-04-13 20:19:03,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12398 conditions, 1497 events. 811/1497 cut-off events. For 27250/27250 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 8890 event pairs, 49 based on Foata normal form. 2/1497 useless extension candidates. Maximal degree in co-relation 12242. Up to 1390 conditions per place. [2025-04-13 20:19:03,804 INFO L140 encePairwiseOnDemand]: 7/17 looper letters, 407 selfloop transitions, 28 changer transitions 4/439 dead transitions. [2025-04-13 20:19:03,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 439 transitions, 7432 flow [2025-04-13 20:19:03,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:19:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:19:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2025-04-13 20:19:03,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4362745098039216 [2025-04-13 20:19:03,805 INFO L175 Difference]: Start difference. First operand has 322 places, 386 transitions, 5619 flow. Second operand 12 states and 89 transitions. [2025-04-13 20:19:03,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 439 transitions, 7432 flow [2025-04-13 20:19:03,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 439 transitions, 7184 flow, removed 60 selfloop flow, removed 21 redundant places. [2025-04-13 20:19:03,930 INFO L231 Difference]: Finished difference. Result has 319 places, 411 transitions, 6109 flow [2025-04-13 20:19:03,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5398, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6109, PETRI_PLACES=319, PETRI_TRANSITIONS=411} [2025-04-13 20:19:03,930 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 300 predicate places. [2025-04-13 20:19:03,931 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 411 transitions, 6109 flow [2025-04-13 20:19:03,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:19:03,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:03,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:19:03,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:19:04,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 20:19:04,131 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:19:04,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 864793889, now seen corresponding path program 24 times [2025-04-13 20:19:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:04,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586217068] [2025-04-13 20:19:04,132 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:19:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:04,134 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:19:04,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:19:04,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:19:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:04,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586217068] [2025-04-13 20:19:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586217068] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:19:04,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962431441] [2025-04-13 20:19:04,667 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:19:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:04,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:19:04,669 INFO L229 MonitoredProcess]: Starting monitored process 36 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:19:04,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 20:19:04,693 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 20:19:04,711 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:19:04,712 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:19:04,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:04,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:19:04,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:19:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:04,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:19:09,315 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse4 (+ .cse0 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (.cse2 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (forall ((v_z_375 Int)) (or (< (mod (+ (* 2 v_z_375) c_~x_2~0) 4294967296) (+ .cse0 .cse1 2)) (< v_z_375 .cse2) (< .cse3 v_z_375))) (forall ((v_z_375 Int)) (let ((.cse5 (mod (+ (* 2 v_z_375) c_~x_2~0) 4294967296))) (or (< .cse4 (+ .cse5 1)) (< v_z_375 .cse2) (< .cse3 v_z_375) (< (+ .cse5 4294967294) (+ .cse0 .cse1))))) (forall ((v_z_375 Int)) (or (< .cse4 (+ (mod (+ (* 2 v_z_375) c_~x_2~0) 4294967296) 4294967297)) (< v_z_375 .cse2) (< .cse3 v_z_375)))))) is different from false [2025-04-13 20:19:13,373 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse0 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_375 Int)) (or (< .cse0 (+ (mod (+ (* 2 v_z_375) c_~x_2~0) 4294967296) 4294967295)) (< v_z_375 .cse1) (< .cse2 v_z_375))) (forall ((v_z_375 Int)) (or (< (mod (+ (* 2 v_z_375) c_~x_2~0) 4294967296) (+ .cse0 3)) (< v_z_375 .cse1) (< .cse2 v_z_375))) (forall ((v_z_375 Int)) (let ((.cse3 (mod (+ (* 2 v_z_375) c_~x_2~0) 4294967296))) (or (< (+ .cse0 1) .cse3) (< v_z_375 .cse1) (< .cse2 v_z_375) (< (+ .cse3 4294967293) .cse0)))))) is different from false [2025-04-13 20:19:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-13 20:19:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962431441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:19:13,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:19:13,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 20:19:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877585661] [2025-04-13 20:19:13,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:19:13,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:19:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:13,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:19:13,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=245, Unknown=2, NotChecked=66, Total=380 [2025-04-13 20:19:13,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:19:13,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 411 transitions, 6109 flow. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:13,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:13,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:19:13,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:14,381 INFO L116 PetriNetUnfolderBase]: 830/1538 cut-off events. [2025-04-13 20:19:14,381 INFO L117 PetriNetUnfolderBase]: For 29876/29876 co-relation queries the response was YES. [2025-04-13 20:19:14,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 1538 events. 830/1538 cut-off events. For 29876/29876 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 9234 event pairs, 51 based on Foata normal form. 2/1538 useless extension candidates. Maximal degree in co-relation 13143. Up to 1379 conditions per place. [2025-04-13 20:19:14,392 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 374 selfloop transitions, 69 changer transitions 8/451 dead transitions. [2025-04-13 20:19:14,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 451 transitions, 7420 flow [2025-04-13 20:19:14,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:19:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:19:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2025-04-13 20:19:14,393 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-04-13 20:19:14,393 INFO L175 Difference]: Start difference. First operand has 319 places, 411 transitions, 6109 flow. Second operand 20 states and 125 transitions. [2025-04-13 20:19:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 451 transitions, 7420 flow [2025-04-13 20:19:14,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 451 transitions, 7293 flow, removed 62 selfloop flow, removed 1 redundant places. [2025-04-13 20:19:14,536 INFO L231 Difference]: Finished difference. Result has 343 places, 419 transitions, 6368 flow [2025-04-13 20:19:14,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5982, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6368, PETRI_PLACES=343, PETRI_TRANSITIONS=419} [2025-04-13 20:19:14,537 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 324 predicate places. [2025-04-13 20:19:14,537 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 419 transitions, 6368 flow [2025-04-13 20:19:14,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:14,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:14,537 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:19:14,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 20:19:14,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 20:19:14,738 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:19:14,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1104435682, now seen corresponding path program 5 times [2025-04-13 20:19:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:14,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663931376] [2025-04-13 20:19:14,738 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:19:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:14,741 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-13 20:19:14,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:19:14,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:19:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:14,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663931376] [2025-04-13 20:19:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663931376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:19:14,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265162539] [2025-04-13 20:19:14,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:19:14,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:19:14,840 INFO L229 MonitoredProcess]: Starting monitored process 37 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:19:14,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 20:19:14,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-13 20:19:14,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:19:14,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:19:14,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:14,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:19:14,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:19:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:19:18,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:19:31,176 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse6 (+ .cse3 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse2 (+ .cse4 v_z_378))) (or (< v_z_378 0) (< .cse0 0) (< .cse1 .cse0) (< 4294967295 .cse2) (= .cse3 .cse2)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse5 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse7 (+ .cse4 v_z_378))) (or (< v_z_378 0) (< .cse5 0) (= .cse6 .cse7) (< .cse1 .cse5) (< 4294967295 v_z_378) (= .cse3 .cse7)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse8 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse9 (+ .cse4 v_z_378))) (or (< .cse8 0) (= .cse6 .cse9) (< .cse1 .cse8) (< 4294967295 v_z_378) (< .cse9 4294967296))))))) is different from false [2025-04-13 20:19:55,428 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:20:07,607 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ .cse2 v_z_378))) (or (< v_z_378 0) (not (= (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)) 0)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse4 (+ .cse2 v_z_378))) (or (= .cse3 .cse4) (not (= (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)) 0)) (< 4294967295 v_z_378) (< .cse4 4294967296)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse5 (+ .cse2 v_z_378))) (or (< v_z_378 0) (= .cse3 .cse5) (not (= (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)) 0)) (< 4294967295 v_z_378) (= .cse1 .cse5))))))) is different from false [2025-04-13 20:20:19,929 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:20:43,999 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:21:20,190 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:21:52,381 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:22:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-13 20:22:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265162539] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:22:00,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:22:00,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 20:22:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691142475] [2025-04-13 20:22:00,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:22:00,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:22:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:00,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:22:00,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=5, NotChecked=50, Total=240 [2025-04-13 20:22:00,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:22:00,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 419 transitions, 6368 flow. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:00,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:00,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:22:00,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:04,636 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ .cse2 v_z_378))) (or (< v_z_378 0) (not (= (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)) 0)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse4 (+ .cse2 v_z_378))) (or (= .cse3 .cse4) (not (= (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)) 0)) (< 4294967295 v_z_378) (< .cse4 4294967296)))) (= c_~x_2~0 0) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse5 (+ .cse2 v_z_378))) (or (< v_z_378 0) (= .cse3 .cse5) (not (= (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)) 0)) (< 4294967295 v_z_378) (= .cse1 .cse5)))) (= c_~x_1~0 0)))) is different from false [2025-04-13 20:22:08,865 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse6 (+ .cse3 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse2 (+ .cse4 v_z_378))) (or (< v_z_378 0) (< .cse0 0) (< .cse1 .cse0) (< 4294967295 .cse2) (= .cse3 .cse2)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse5 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse7 (+ .cse4 v_z_378))) (or (< v_z_378 0) (< .cse5 0) (= .cse6 .cse7) (< .cse1 .cse5) (< 4294967295 v_z_378) (= .cse3 .cse7)))) (= c_~x_1~0 0) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse8 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse9 (+ .cse4 v_z_378))) (or (< .cse8 0) (= .cse6 .cse9) (< .cse1 .cse8) (< 4294967295 v_z_378) (< .cse9 4294967296))))))) is different from false [2025-04-13 20:22:09,565 INFO L116 PetriNetUnfolderBase]: 877/1646 cut-off events. [2025-04-13 20:22:09,565 INFO L117 PetriNetUnfolderBase]: For 35816/35816 co-relation queries the response was YES. [2025-04-13 20:22:09,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15006 conditions, 1646 events. 877/1646 cut-off events. For 35816/35816 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10159 event pairs, 141 based on Foata normal form. 2/1646 useless extension candidates. Maximal degree in co-relation 14815. Up to 1488 conditions per place. [2025-04-13 20:22:09,578 INFO L140 encePairwiseOnDemand]: 7/17 looper letters, 440 selfloop transitions, 46 changer transitions 4/490 dead transitions. [2025-04-13 20:22:09,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 490 transitions, 8940 flow [2025-04-13 20:22:09,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:22:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:22:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2025-04-13 20:22:09,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-13 20:22:09,579 INFO L175 Difference]: Start difference. First operand has 343 places, 419 transitions, 6368 flow. Second operand 11 states and 85 transitions. [2025-04-13 20:22:09,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 490 transitions, 8940 flow [2025-04-13 20:22:09,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 490 transitions, 8772 flow, removed 44 selfloop flow, removed 13 redundant places. [2025-04-13 20:22:09,778 INFO L231 Difference]: Finished difference. Result has 347 places, 462 transitions, 7635 flow [2025-04-13 20:22:09,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=6233, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7635, PETRI_PLACES=347, PETRI_TRANSITIONS=462} [2025-04-13 20:22:09,778 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 328 predicate places. [2025-04-13 20:22:09,778 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 462 transitions, 7635 flow [2025-04-13 20:22:09,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:09,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:09,778 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:09,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 20:22:09,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:09,979 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:09,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 949998164, now seen corresponding path program 6 times [2025-04-13 20:22:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:09,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238306923] [2025-04-13 20:22:09,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:22:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:09,981 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 3 equivalence classes. [2025-04-13 20:22:09,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:22:09,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:22:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:22:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:10,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238306923] [2025-04-13 20:22:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238306923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:10,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464077882] [2025-04-13 20:22:10,074 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:22:10,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:10,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:10,076 INFO L229 MonitoredProcess]: Starting monitored process 38 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:22:10,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 20:22:10,099 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 3 equivalence classes. [2025-04-13 20:22:10,130 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:22:10,130 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:22:10,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:10,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:22:10,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:22:14,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:36,375 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse0 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse1 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse2 (+ .cse4 v_z_382))) (or (< .cse0 .cse1) (= .cse2 .cse3) (< .cse1 0) (< v_z_382 0) (< 4294967295 .cse2)))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse5 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse6 (+ .cse4 v_z_382))) (or (< .cse0 .cse5) (= .cse6 .cse3) (< 4294967295 v_z_382) (< .cse5 0) (< v_z_382 0) (= .cse7 .cse6)))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse8 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse9 (+ .cse4 v_z_382))) (or (< .cse0 .cse8) (< 4294967295 v_z_382) (< .cse8 0) (< .cse9 4294967296) (= .cse7 .cse9))))))) is different from false [2025-04-13 20:22:48,596 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:23:20,767 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:23:28,865 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse0 (+ .cse3 v_z_382))) (or (= .cse0 .cse1) (< 4294967295 v_z_382) (< v_z_382 0) (= .cse2 .cse0) (not (= (+ (* 2863311531 v_z_382) (* v_y_382 4294967296)) 0))))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse4 (+ .cse3 v_z_382))) (or (= .cse4 .cse1) (< v_z_382 0) (< 4294967295 .cse4) (not (= (+ (* 2863311531 v_z_382) (* v_y_382 4294967296)) 0))))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse5 (+ .cse3 v_z_382))) (or (< 4294967295 v_z_382) (< .cse5 4294967296) (= .cse2 .cse5) (not (= (+ (* 2863311531 v_z_382) (* v_y_382 4294967296)) 0)))))))) is different from false [2025-04-13 20:24:05,467 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:24:26,891 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:24:42,936 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:24:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464077882] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:46,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-13 20:24:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339036520] [2025-04-13 20:24:46,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:46,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:24:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:24:46,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=227, Unknown=7, NotChecked=66, Total=380 [2025-04-13 20:24:46,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:24:46,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 462 transitions, 7635 flow. Second operand has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 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:24:46,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:46,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:24:46,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:51,134 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse0 (+ .cse3 v_z_382))) (or (= .cse0 .cse1) (< 4294967295 v_z_382) (< v_z_382 0) (= .cse2 .cse0) (not (= (+ (* 2863311531 v_z_382) (* v_y_382 4294967296)) 0))))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse4 (+ .cse3 v_z_382))) (or (= .cse4 .cse1) (< v_z_382 0) (< 4294967295 .cse4) (not (= (+ (* 2863311531 v_z_382) (* v_y_382 4294967296)) 0))))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse5 (+ .cse3 v_z_382))) (or (< 4294967295 v_z_382) (< .cse5 4294967296) (= .cse2 .cse5) (not (= (+ (* 2863311531 v_z_382) (* v_y_382 4294967296)) 0))))) (= c_~x_1~0 0)))) is different from false [2025-04-13 20:24:55,319 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse0 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse1 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse2 (+ .cse4 v_z_382))) (or (< .cse0 .cse1) (= .cse2 .cse3) (< .cse1 0) (< v_z_382 0) (< 4294967295 .cse2)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse5 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse6 (+ .cse4 v_z_382))) (or (< .cse0 .cse5) (= .cse6 .cse3) (< 4294967295 v_z_382) (< .cse5 0) (< v_z_382 0) (= .cse7 .cse6)))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse8 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse9 (+ .cse4 v_z_382))) (or (< .cse0 .cse8) (< 4294967295 v_z_382) (< .cse8 0) (< .cse9 4294967296) (= .cse7 .cse9))))))) is different from false [2025-04-13 20:24:59,744 WARN L849 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (or (let ((.cse3 (mod c_~x_1~0 4294967296))) (let ((.cse0 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse1 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse2 (+ .cse4 v_z_382))) (or (< .cse0 .cse1) (= .cse2 .cse3) (< .cse1 0) (< v_z_382 0) (< 4294967295 .cse2)))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse5 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse6 (+ .cse4 v_z_382))) (or (< .cse0 .cse5) (= .cse6 .cse3) (< 4294967295 v_z_382) (< .cse5 0) (< v_z_382 0) (= .cse7 .cse6)))) (forall ((v_y_382 Int) (v_z_382 Int)) (let ((.cse8 (+ (* 2863311531 v_z_382) (* v_y_382 4294967296))) (.cse9 (+ .cse4 v_z_382))) (or (< .cse0 .cse8) (< 4294967295 v_z_382) (< .cse8 0) (< .cse9 4294967296) (= .cse7 .cse9))))))) (< 4294967294 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)))) is different from false [2025-04-13 20:25:01,531 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:25:05,659 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 [1] [2025-04-13 20:25:09,948 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 [1] [2025-04-13 20:25:10,526 INFO L116 PetriNetUnfolderBase]: 947/1780 cut-off events. [2025-04-13 20:25:10,526 INFO L117 PetriNetUnfolderBase]: For 44006/44006 co-relation queries the response was YES. [2025-04-13 20:25:10,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17294 conditions, 1780 events. 947/1780 cut-off events. For 44006/44006 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 11125 event pairs, 305 based on Foata normal form. 3/1781 useless extension candidates. Maximal degree in co-relation 17093. Up to 1664 conditions per place. [2025-04-13 20:25:10,539 INFO L140 encePairwiseOnDemand]: 6/17 looper letters, 485 selfloop transitions, 40 changer transitions 10/535 dead transitions. [2025-04-13 20:25:10,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 535 transitions, 10194 flow [2025-04-13 20:25:10,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:25:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:25:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 121 transitions. [2025-04-13 20:25:10,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2025-04-13 20:25:10,540 INFO L175 Difference]: Start difference. First operand has 347 places, 462 transitions, 7635 flow. Second operand 18 states and 121 transitions. [2025-04-13 20:25:10,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 535 transitions, 10194 flow [2025-04-13 20:25:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 535 transitions, 10066 flow, removed 64 selfloop flow, removed 0 redundant places. [2025-04-13 20:25:10,767 INFO L231 Difference]: Finished difference. Result has 379 places, 500 transitions, 8751 flow [2025-04-13 20:25:10,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=7507, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8751, PETRI_PLACES=379, PETRI_TRANSITIONS=500} [2025-04-13 20:25:10,767 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 360 predicate places. [2025-04-13 20:25:10,767 INFO L485 AbstractCegarLoop]: Abstraction has has 379 places, 500 transitions, 8751 flow [2025-04-13 20:25:10,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 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:25:10,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:10,767 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:10,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 20:25:10,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:25:10,968 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:25:10,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1584916192, now seen corresponding path program 7 times [2025-04-13 20:25:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:10,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218658442] [2025-04-13 20:25:10,968 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:25:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:10,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:25:10,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:25:10,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:10,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:11,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218658442] [2025-04-13 20:25:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218658442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:25:11,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166627277] [2025-04-13 20:25:11,086 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:25:11,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:11,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:11,088 INFO L229 MonitoredProcess]: Starting monitored process 39 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:25:11,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 20:25:11,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:25:11,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:25:11,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:11,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:11,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:25:11,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:25:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:15,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:25:27,609 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~x_1~0 4294967296))) (let ((.cse2 (+ .cse7 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse1 (+ .cse4 v_z_385)) (.cse0 (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)))) (or (< .cse0 0) (< .cse1 4294967296) (< 4294967295 v_z_385) (= .cse2 .cse1) (< .cse3 .cse0)))) (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse5 (+ (* v_y_385 4294967296) (* 2863311531 v_z_385))) (.cse6 (+ .cse4 v_z_385))) (or (< .cse5 0) (< 4294967295 v_z_385) (= .cse2 .cse6) (< .cse3 .cse5) (< v_z_385 0) (= .cse7 .cse6)))) (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse8 (+ (* v_y_385 4294967296) (* 2863311531 v_z_385))) (.cse9 (+ .cse4 v_z_385))) (or (< .cse8 0) (< .cse3 .cse8) (< v_z_385 0) (= .cse7 .cse9) (< 4294967295 .cse9))))))) is different from false [2025-04-13 20:25:38,228 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:26:06,315 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:26:10,392 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse1 (+ .cse2 v_z_385))) (or (not (= (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)) 0)) (< v_z_385 0) (= .cse0 .cse1) (< 4294967295 .cse1)))) (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse3 (+ .cse2 v_z_385))) (or (not (= (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)) 0)) (< .cse3 4294967296) (< 4294967295 v_z_385) (= .cse4 .cse3)))) (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse5 (+ .cse2 v_z_385))) (or (not (= (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)) 0)) (< 4294967295 v_z_385) (= .cse4 .cse5) (< v_z_385 0) (= .cse0 .cse5))))))) is different from false [2025-04-13 20:26:26,389 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:26:50,459 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:26:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-13 20:26:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166627277] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:26:50,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:26:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 20:26:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387583370] [2025-04-13 20:26:50,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:26:50,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:26:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:50,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:26:50,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=5, NotChecked=50, Total=240 [2025-04-13 20:26:50,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-13 20:26:50,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 500 transitions, 8751 flow. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:26:50,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:50,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-13 20:26:50,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:54,509 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse1 (+ .cse2 v_z_385))) (or (not (= (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)) 0)) (< v_z_385 0) (= .cse0 .cse1) (< 4294967295 .cse1)))) (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse3 (+ .cse2 v_z_385))) (or (not (= (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)) 0)) (< .cse3 4294967296) (< 4294967295 v_z_385) (= .cse4 .cse3)))) (= c_~x_2~0 0) (forall ((v_z_385 Int) (v_y_385 Int)) (let ((.cse5 (+ .cse2 v_z_385))) (or (not (= (+ (* v_y_385 4294967296) (* 2863311531 v_z_385)) 0)) (< 4294967295 v_z_385) (= .cse4 .cse5) (< v_z_385 0) (= .cse0 .cse5)))) (= c_~x_1~0 0)))) is different from false Received shutdown request... [2025-04-13 20:26:56,796 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:26:56,797 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:26:57,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 20:26:58,002 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:26:58,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:26:58,021 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:26:58,022 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:26:58,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 20:26:58,023 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 20:26:58,023 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:26:58,024 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:26:58,024 INFO L422 BasicCegarLoop]: Path program histogram: [24, 7, 7, 1] [2025-04-13 20:26:58,029 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:26:58,029 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:26:58,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:26:58 BasicIcfg [2025-04-13 20:26:58,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:26:58,033 INFO L158 Benchmark]: Toolchain (without parser) took 875200.07ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 99.3MB in the beginning and 202.4MB in the end (delta: -103.1MB). Peak memory consumption was 174.4MB. Max. memory is 8.0GB. [2025-04-13 20:26:58,033 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:26:58,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.73ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 84.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:26:58,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.47ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.6MB in the end (delta: 859.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:26:58,033 INFO L158 Benchmark]: Boogie Preprocessor took 22.73ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:26:58,034 INFO L158 Benchmark]: RCFGBuilder took 306.37ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 60.0MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 20:26:58,034 INFO L158 Benchmark]: TraceAbstraction took 874603.20ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 59.3MB in the beginning and 202.4MB in the end (delta: -143.1MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2025-04-13 20:26:58,034 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.73ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 84.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.47ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.6MB in the end (delta: 859.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.73ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 306.37ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 60.0MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 874603.20ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 59.3MB in the beginning and 202.4MB in the end (delta: -143.1MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: 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 5 procedures, 24 locations, 27 edges, 3 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: 874.5s, OverallIterations: 39, TraceHistogramMax: 3, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 148.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 1672 SdHoareTripleChecker+Valid, 86.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1672 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 85.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1123 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14781 IncrementalHoareTripleChecker+Invalid, 16510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 0 mSDtfsCounter, 14781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 636 SyntacticMatches, 41 SemanticMatches, 850 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 5815 ImplicationChecksByTransitivity, 174.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8751occurred in iteration=38, InterpolantAutomatonStates: 697, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 715.9s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 1514 ConstructedInterpolants, 38 QuantifiedInterpolants, 28486 SizeOfPredicates, 138 NumberOfNonLiveVariables, 3645 ConjunctsInSsa, 734 ConjunctsInUnsatCore, 115 InterpolantComputations, 1 PerfectInterpolantSequences, 0/327 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