/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 22:04:12,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 22:04:12,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 22:04:12,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 22:04:12,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 22:04:12,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 22:04:12,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 22:04:12,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 22:04:12,946 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 22:04:12,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 22:04:12,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 22:04:12,949 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 22:04:12,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 22:04:12,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 22:04:12,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 22:04:12,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 22:04:12,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 22:04:12,951 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 22:04:12,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 22:04:12,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:04:12,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 22:04:12,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 22:04:12,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 22:04:12,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 22:04:12,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 22:04:12,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 22:04:12,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 22:04:12,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 22:04:13,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 22:04:13,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 22:04:13,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 22:04:13,157 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 22:04:13,157 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 22:04:13,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-11-29 22:04:14,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 22:04:14,233 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 22:04:14,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-11-29 22:04:14,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4228d4693/2bb8a9bff7084987ba95de502db78a62/FLAGc1add3ea5 [2023-11-29 22:04:14,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4228d4693/2bb8a9bff7084987ba95de502db78a62 [2023-11-29 22:04:14,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 22:04:14,253 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 22:04:14,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 22:04:14,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 22:04:14,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 22:04:14,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64710a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14, skipping insertion in model container [2023-11-29 22:04:14,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,282 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 22:04:14,396 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2528,2541] [2023-11-29 22:04:14,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:04:14,407 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 22:04:14,421 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2528,2541] [2023-11-29 22:04:14,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:04:14,429 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:04:14,429 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:04:14,433 INFO L206 MainTranslator]: Completed translation [2023-11-29 22:04:14,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14 WrapperNode [2023-11-29 22:04:14,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 22:04:14,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 22:04:14,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 22:04:14,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 22:04:14,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,463 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-11-29 22:04:14,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 22:04:14,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 22:04:14,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 22:04:14,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 22:04:14,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 22:04:14,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 22:04:14,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 22:04:14,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 22:04:14,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (1/1) ... [2023-11-29 22:04:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:04:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:04:14,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 22:04:14,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 22:04:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 22:04:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 22:04:14,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 22:04:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 22:04:14,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 22:04:14,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 22:04:14,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 22:04:14,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 22:04:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 22:04:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 22:04:14,533 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 22:04:14,602 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 22:04:14,603 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 22:04:14,769 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 22:04:14,806 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 22:04:14,806 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 22:04:14,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:04:14 BoogieIcfgContainer [2023-11-29 22:04:14,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 22:04:14,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 22:04:14,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 22:04:14,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 22:04:14,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:04:14" (1/3) ... [2023-11-29 22:04:14,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b4b191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:04:14, skipping insertion in model container [2023-11-29 22:04:14,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:04:14" (2/3) ... [2023-11-29 22:04:14,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b4b191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:04:14, skipping insertion in model container [2023-11-29 22:04:14,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:04:14" (3/3) ... [2023-11-29 22:04:14,812 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-11-29 22:04:14,822 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 22:04:14,823 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 22:04:14,823 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 22:04:14,875 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 22:04:14,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 129 transitions, 286 flow [2023-11-29 22:04:14,947 INFO L124 PetriNetUnfolderBase]: 9/125 cut-off events. [2023-11-29 22:04:14,947 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 22:04:14,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 125 events. 9/125 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-11-29 22:04:14,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 129 transitions, 286 flow [2023-11-29 22:04:14,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 112 transitions, 248 flow [2023-11-29 22:04:14,961 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 22:04:14,967 INFO L362 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, mHoare=true, 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;@298dc675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 22:04:14,967 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 22:04:14,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 22:04:14,994 INFO L124 PetriNetUnfolderBase]: 9/111 cut-off events. [2023-11-29 22:04:14,994 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 22:04:14,994 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:14,995 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:14,995 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:14,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1047961809, now seen corresponding path program 1 times [2023-11-29 22:04:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582855220] [2023-11-29 22:04:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582855220] [2023-11-29 22:04:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582855220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:04:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:04:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 22:04:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530406163] [2023-11-29 22:04:15,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:04:15,525 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 22:04:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 22:04:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 22:04:15,551 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 129 [2023-11-29 22:04:15,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 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) [2023-11-29 22:04:15,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:15,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 129 [2023-11-29 22:04:15,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:04:15,773 INFO L124 PetriNetUnfolderBase]: 103/520 cut-off events. [2023-11-29 22:04:15,773 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-11-29 22:04:15,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 520 events. 103/520 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2444 event pairs, 28 based on Foata normal form. 131/607 useless extension candidates. Maximal degree in co-relation 395. Up to 119 conditions per place. [2023-11-29 22:04:15,781 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 36 selfloop transitions, 5 changer transitions 8/135 dead transitions. [2023-11-29 22:04:15,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 428 flow [2023-11-29 22:04:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 22:04:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 22:04:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 884 transitions. [2023-11-29 22:04:15,797 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8565891472868217 [2023-11-29 22:04:15,798 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 884 transitions. [2023-11-29 22:04:15,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 884 transitions. [2023-11-29 22:04:15,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:04:15,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 884 transitions. [2023-11-29 22:04:15,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 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) [2023-11-29 22:04:15,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 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) [2023-11-29 22:04:15,815 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 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) [2023-11-29 22:04:15,818 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 7 predicate places. [2023-11-29 22:04:15,818 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 135 transitions, 428 flow [2023-11-29 22:04:15,819 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 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) [2023-11-29 22:04:15,819 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:15,819 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:15,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 22:04:15,820 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:15,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -508195913, now seen corresponding path program 1 times [2023-11-29 22:04:15,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:15,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073240295] [2023-11-29 22:04:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:15,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:15,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073240295] [2023-11-29 22:04:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073240295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:04:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:04:15,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:04:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283168456] [2023-11-29 22:04:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:04:15,989 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:04:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:15,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:04:15,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:04:15,991 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:04:15,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 135 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:15,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:15,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:04:15,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:04:17,104 INFO L124 PetriNetUnfolderBase]: 8069/13418 cut-off events. [2023-11-29 22:04:17,104 INFO L125 PetriNetUnfolderBase]: For 3921/4132 co-relation queries the response was YES. [2023-11-29 22:04:17,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27857 conditions, 13418 events. 8069/13418 cut-off events. For 3921/4132 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 103498 event pairs, 3643 based on Foata normal form. 5/10450 useless extension candidates. Maximal degree in co-relation 24021. Up to 6677 conditions per place. [2023-11-29 22:04:17,205 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 102 selfloop transitions, 7 changer transitions 8/199 dead transitions. [2023-11-29 22:04:17,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 199 transitions, 880 flow [2023-11-29 22:04:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 22:04:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 22:04:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2023-11-29 22:04:17,207 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8480620155038759 [2023-11-29 22:04:17,207 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2023-11-29 22:04:17,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2023-11-29 22:04:17,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:04:17,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2023-11-29 22:04:17,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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) [2023-11-29 22:04:17,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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) [2023-11-29 22:04:17,210 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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) [2023-11-29 22:04:17,210 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 11 predicate places. [2023-11-29 22:04:17,210 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 199 transitions, 880 flow [2023-11-29 22:04:17,211 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:17,211 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:17,211 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:17,212 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 22:04:17,212 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:17,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1611952049, now seen corresponding path program 1 times [2023-11-29 22:04:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318714740] [2023-11-29 22:04:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318714740] [2023-11-29 22:04:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318714740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:04:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:04:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:04:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471973495] [2023-11-29 22:04:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:04:17,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:04:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:04:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:04:17,384 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:04:17,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 199 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:17,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:17,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:04:17,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:04:18,886 INFO L124 PetriNetUnfolderBase]: 12809/20570 cut-off events. [2023-11-29 22:04:18,886 INFO L125 PetriNetUnfolderBase]: For 8198/12879 co-relation queries the response was YES. [2023-11-29 22:04:18,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60181 conditions, 20570 events. 12809/20570 cut-off events. For 8198/12879 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 159689 event pairs, 3386 based on Foata normal form. 104/15991 useless extension candidates. Maximal degree in co-relation 52484. Up to 10319 conditions per place. [2023-11-29 22:04:19,020 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 247 selfloop transitions, 27 changer transitions 13/369 dead transitions. [2023-11-29 22:04:19,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 369 transitions, 2365 flow [2023-11-29 22:04:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 22:04:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 22:04:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-11-29 22:04:19,022 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8617571059431525 [2023-11-29 22:04:19,022 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-11-29 22:04:19,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-11-29 22:04:19,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:04:19,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-11-29 22:04:19,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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) [2023-11-29 22:04:19,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-11-29 22:04:19,025 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-11-29 22:04:19,026 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 16 predicate places. [2023-11-29 22:04:19,026 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 369 transitions, 2365 flow [2023-11-29 22:04:19,027 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:19,027 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:19,027 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:19,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 22:04:19,027 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:19,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 18705809, now seen corresponding path program 2 times [2023-11-29 22:04:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090285897] [2023-11-29 22:04:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090285897] [2023-11-29 22:04:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090285897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:04:19,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:04:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:04:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708149006] [2023-11-29 22:04:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:04:19,112 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:04:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:04:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:04:19,114 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:04:19,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 369 transitions, 2365 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:19,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:19,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:04:19,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:04:20,751 INFO L124 PetriNetUnfolderBase]: 12996/21298 cut-off events. [2023-11-29 22:04:20,751 INFO L125 PetriNetUnfolderBase]: For 13344/33002 co-relation queries the response was YES. [2023-11-29 22:04:20,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78617 conditions, 21298 events. 12996/21298 cut-off events. For 13344/33002 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 169797 event pairs, 2601 based on Foata normal form. 415/17100 useless extension candidates. Maximal degree in co-relation 68392. Up to 10521 conditions per place. [2023-11-29 22:04:20,895 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 305 selfloop transitions, 17 changer transitions 69/473 dead transitions. [2023-11-29 22:04:20,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 473 transitions, 3890 flow [2023-11-29 22:04:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:04:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:04:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-11-29 22:04:20,897 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8372093023255814 [2023-11-29 22:04:20,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-11-29 22:04:20,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-11-29 22:04:20,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:04:20,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-11-29 22:04:20,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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) [2023-11-29 22:04:20,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:04:20,901 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:04:20,901 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 22 predicate places. [2023-11-29 22:04:20,901 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 473 transitions, 3890 flow [2023-11-29 22:04:20,901 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:20,901 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:20,902 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:20,902 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 22:04:20,902 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:20,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 470407425, now seen corresponding path program 3 times [2023-11-29 22:04:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173457877] [2023-11-29 22:04:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:20,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173457877] [2023-11-29 22:04:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173457877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:04:20,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:04:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:04:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711876468] [2023-11-29 22:04:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:04:20,972 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:04:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:20,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:04:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:04:20,973 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:04:20,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 473 transitions, 3890 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:20,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:20,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:04:20,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:04:23,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 87#L63true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,568 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 36#L51-5true, 151#true, 87#L63true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,568 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,568 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 45#L62-6true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,569 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 36#L51-5true, 151#true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 45#L62-6true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,569 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 22:04:23,569 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 22:04:23,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 13#L65true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,859 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,864 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 151#true, 36#L51-5true, 138#(= ~counter1~0 0), 7#L91-4true, 13#L65true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,865 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 36#L51-5true, 151#true, 10#L68true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,865 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,865 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 151#true, 36#L51-5true, 10#L68true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:23,866 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,866 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:23,866 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-29 22:04:23,866 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, 9#L62-3true, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:24,003 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, 9#L62-3true, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 36#L51-5true, 151#true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:04:24,003 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 22:04:24,003 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 22:04:25,161 INFO L124 PetriNetUnfolderBase]: 33868/53070 cut-off events. [2023-11-29 22:04:25,162 INFO L125 PetriNetUnfolderBase]: For 90175/128941 co-relation queries the response was YES. [2023-11-29 22:04:25,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228846 conditions, 53070 events. 33868/53070 cut-off events. For 90175/128941 co-relation queries the response was YES. Maximal size of possible extension queue 2388. Compared 449620 event pairs, 6197 based on Foata normal form. 662/44129 useless extension candidates. Maximal degree in co-relation 201875. Up to 25420 conditions per place. [2023-11-29 22:04:25,667 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 1140 selfloop transitions, 42 changer transitions 273/1560 dead transitions. [2023-11-29 22:04:25,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1560 transitions, 17266 flow [2023-11-29 22:04:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:04:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:04:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 762 transitions. [2023-11-29 22:04:25,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8438538205980066 [2023-11-29 22:04:25,669 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 762 transitions. [2023-11-29 22:04:25,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 762 transitions. [2023-11-29 22:04:25,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:04:25,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 762 transitions. [2023-11-29 22:04:25,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 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) [2023-11-29 22:04:25,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:04:25,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:04:25,674 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 28 predicate places. [2023-11-29 22:04:25,674 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 1560 transitions, 17266 flow [2023-11-29 22:04:25,674 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:25,675 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:25,675 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:25,675 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 22:04:25,675 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:25,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 247327351, now seen corresponding path program 4 times [2023-11-29 22:04:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267863667] [2023-11-29 22:04:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267863667] [2023-11-29 22:04:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267863667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:04:25,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:04:25,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:04:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489211105] [2023-11-29 22:04:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:04:25,752 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:04:25,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:25,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:04:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:04:25,753 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:04:25,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 1560 transitions, 17266 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:25,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:25,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:04:25,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:04:38,294 INFO L124 PetriNetUnfolderBase]: 72118/109791 cut-off events. [2023-11-29 22:04:38,294 INFO L125 PetriNetUnfolderBase]: For 309486/497891 co-relation queries the response was YES. [2023-11-29 22:04:38,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528023 conditions, 109791 events. 72118/109791 cut-off events. For 309486/497891 co-relation queries the response was YES. Maximal size of possible extension queue 4364. Compared 950595 event pairs, 14124 based on Foata normal form. 1885/95012 useless extension candidates. Maximal degree in co-relation 454430. Up to 49232 conditions per place. [2023-11-29 22:04:39,381 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 2079 selfloop transitions, 349 changer transitions 614/3151 dead transitions. [2023-11-29 22:04:39,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 3151 transitions, 40740 flow [2023-11-29 22:04:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 22:04:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 22:04:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions. [2023-11-29 22:04:39,383 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8643410852713178 [2023-11-29 22:04:39,383 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 669 transitions. [2023-11-29 22:04:39,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions. [2023-11-29 22:04:39,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:04:39,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions. [2023-11-29 22:04:39,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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) [2023-11-29 22:04:39,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-11-29 22:04:39,385 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-11-29 22:04:39,385 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 33 predicate places. [2023-11-29 22:04:39,386 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 3151 transitions, 40740 flow [2023-11-29 22:04:39,386 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:04:39,386 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:04:39,386 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:04:39,386 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 22:04:39,386 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:04:39,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:04:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1798699185, now seen corresponding path program 5 times [2023-11-29 22:04:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:04:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98896025] [2023-11-29 22:04:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:04:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:04:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:04:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:39,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:04:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98896025] [2023-11-29 22:04:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98896025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:04:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554183060] [2023-11-29 22:04:39,445 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 22:04:39,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:04:39,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:04:39,447 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) [2023-11-29 22:04:39,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 22:04:39,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:04:39,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:04:39,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 22:04:39,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:04:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:39,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:04:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:04:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554183060] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:04:39,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:04:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 22:04:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298378523] [2023-11-29 22:04:39,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:04:39,690 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:04:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:04:39,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:04:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 22:04:39,691 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:04:39,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 3151 transitions, 40740 flow. Second operand has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 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) [2023-11-29 22:04:39,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:04:39,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:04:39,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:05:04,842 INFO L124 PetriNetUnfolderBase]: 89889/136347 cut-off events. [2023-11-29 22:05:04,843 INFO L125 PetriNetUnfolderBase]: For 404272/511491 co-relation queries the response was YES. [2023-11-29 22:05:05,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755816 conditions, 136347 events. 89889/136347 cut-off events. For 404272/511491 co-relation queries the response was YES. Maximal size of possible extension queue 5114. Compared 1191922 event pairs, 9666 based on Foata normal form. 1657/119052 useless extension candidates. Maximal degree in co-relation 650967. Up to 62095 conditions per place. [2023-11-29 22:05:06,464 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 4215 selfloop transitions, 937 changer transitions 1064/6325 dead transitions. [2023-11-29 22:05:06,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 6325 transitions, 94849 flow [2023-11-29 22:05:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 22:05:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 22:05:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1508 transitions. [2023-11-29 22:05:06,467 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8349944629014396 [2023-11-29 22:05:06,467 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1508 transitions. [2023-11-29 22:05:06,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1508 transitions. [2023-11-29 22:05:06,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:05:06,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1508 transitions. [2023-11-29 22:05:06,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 107.71428571428571) internal successors, (1508), 14 states have internal predecessors, (1508), 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) [2023-11-29 22:05:06,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 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) [2023-11-29 22:05:06,473 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 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) [2023-11-29 22:05:06,473 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 46 predicate places. [2023-11-29 22:05:06,473 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 6325 transitions, 94849 flow [2023-11-29 22:05:06,473 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 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) [2023-11-29 22:05:06,473 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:05:06,474 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:05:06,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 22:05:06,678 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:05:06,679 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:05:06,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:05:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2107255297, now seen corresponding path program 2 times [2023-11-29 22:05:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:05:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714233701] [2023-11-29 22:05:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:05:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:05:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:05:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:05:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:05:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714233701] [2023-11-29 22:05:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714233701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:05:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958401867] [2023-11-29 22:05:06,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:05:06,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:05:06,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:05:06,744 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) [2023-11-29 22:05:06,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 22:05:06,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:05:06,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:05:06,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 22:05:06,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:05:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:05:06,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:05:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:05:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958401867] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:05:06,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:05:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 22:05:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000809956] [2023-11-29 22:05:06,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:05:06,918 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:05:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:05:06,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:05:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 22:05:06,919 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:05:06,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 6325 transitions, 94849 flow. Second operand has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 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) [2023-11-29 22:05:06,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:05:06,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:05:06,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:05:56,856 INFO L124 PetriNetUnfolderBase]: 111478/167989 cut-off events. [2023-11-29 22:05:56,856 INFO L125 PetriNetUnfolderBase]: For 733194/980864 co-relation queries the response was YES. [2023-11-29 22:05:57,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060359 conditions, 167989 events. 111478/167989 cut-off events. For 733194/980864 co-relation queries the response was YES. Maximal size of possible extension queue 6350. Compared 1488408 event pairs, 7515 based on Foata normal form. 6281/149740 useless extension candidates. Maximal degree in co-relation 928250. Up to 86082 conditions per place. [2023-11-29 22:05:59,112 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 5929 selfloop transitions, 1117 changer transitions 1259/8425 dead transitions. [2023-11-29 22:05:59,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 8425 transitions, 142741 flow [2023-11-29 22:05:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 22:05:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 22:05:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1500 transitions. [2023-11-29 22:05:59,115 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8305647840531561 [2023-11-29 22:05:59,115 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1500 transitions. [2023-11-29 22:05:59,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1500 transitions. [2023-11-29 22:05:59,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:05:59,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1500 transitions. [2023-11-29 22:05:59,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 107.14285714285714) internal successors, (1500), 14 states have internal predecessors, (1500), 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) [2023-11-29 22:05:59,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 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) [2023-11-29 22:05:59,120 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 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) [2023-11-29 22:05:59,120 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 59 predicate places. [2023-11-29 22:05:59,120 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 8425 transitions, 142741 flow [2023-11-29 22:05:59,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 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) [2023-11-29 22:05:59,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:05:59,121 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:05:59,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 22:05:59,325 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 22:05:59,327 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:05:59,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:05:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1538369063, now seen corresponding path program 3 times [2023-11-29 22:05:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:05:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458380990] [2023-11-29 22:05:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:05:59,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:05:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:05:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:05:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:05:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458380990] [2023-11-29 22:05:59,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458380990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:05:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:05:59,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:05:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279114891] [2023-11-29 22:05:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:05:59,393 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:05:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:05:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:05:59,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:05:59,395 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:05:59,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 8425 transitions, 142741 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:05:59,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:05:59,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:05:59,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:06:12,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L51-5-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_3) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][82], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 80#L41-4true, 157#true, 151#true, 10#L68true, 136#true, 74#L52true, 165#true, 21#L72-5true, 764#(<= 1 ~N~0), 7#L91-4true, 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:06:12,670 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L51-5-->L51-6: Formula: (<= v_~N~0_4 |v_thread2Thread1of1ForFork0_~i~1#1_5|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][83], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 80#L41-4true, 151#true, 95#L51-6true, 10#L68true, 136#true, 182#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), 165#true, 21#L72-5true, 764#(<= 1 ~N~0), 7#L91-4true, 1324#true, 196#true, 188#true]) [2023-11-29 22:06:12,670 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1837], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 80#L41-4true, 151#true, 36#L51-5true, 10#L68true, 136#true, 25#L73true, 585#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), 165#true, 7#L91-4true, 764#(<= 1 ~N~0), 1324#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:06:12,671 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1838], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 80#L41-4true, 151#true, 36#L51-5true, 10#L68true, 136#true, 165#true, 7#L91-4true, 764#(<= 1 ~N~0), 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:06:12,671 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:12,671 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 22:06:18,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L41-5-->L41-6: Formula: (<= v_~N~0_1 v_thread1Thread1of1ForFork2_~i~0_5) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][89], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 70#L41-6true, 157#true, 151#true, 36#L51-5true, 10#L68true, 136#true, 1310#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0)), 165#true, 7#L91-4true, 21#L72-5true, 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:06:18,010 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,010 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,010 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,010 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L41-5-->L42: Formula: (< v_thread1Thread1of1ForFork2_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][90], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 84#L42true, 36#L51-5true, 151#true, 10#L68true, 136#true, 165#true, 764#(<= 1 ~N~0), 7#L91-4true, 21#L72-5true, 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-11-29 22:06:18,012 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,012 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,012 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-11-29 22:06:18,012 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-11-29 22:07:12,686 INFO L124 PetriNetUnfolderBase]: 109897/166697 cut-off events. [2023-11-29 22:07:12,686 INFO L125 PetriNetUnfolderBase]: For 838487/974230 co-relation queries the response was YES. [2023-11-29 22:07:13,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161507 conditions, 166697 events. 109897/166697 cut-off events. For 838487/974230 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1494438 event pairs, 7835 based on Foata normal form. 3890/147712 useless extension candidates. Maximal degree in co-relation 998896. Up to 83883 conditions per place. [2023-11-29 22:07:14,953 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 6708 selfloop transitions, 316 changer transitions 1307/8451 dead transitions. [2023-11-29 22:07:14,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 8451 transitions, 159887 flow [2023-11-29 22:07:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 22:07:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 22:07:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-11-29 22:07:14,955 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8617571059431525 [2023-11-29 22:07:14,955 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-11-29 22:07:14,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-11-29 22:07:14,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:07:14,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-11-29 22:07:14,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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) [2023-11-29 22:07:14,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-11-29 22:07:14,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-11-29 22:07:14,957 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 64 predicate places. [2023-11-29 22:07:14,958 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 8451 transitions, 159887 flow [2023-11-29 22:07:14,958 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:07:14,958 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:07:14,958 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:07:14,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 22:07:14,958 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:07:14,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:07:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1854655471, now seen corresponding path program 4 times [2023-11-29 22:07:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:07:14,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471107185] [2023-11-29 22:07:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:07:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:07:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:07:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:07:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:07:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471107185] [2023-11-29 22:07:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471107185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:07:15,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:07:15,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:07:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19710027] [2023-11-29 22:07:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:07:15,166 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:07:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:07:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:07:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:07:15,167 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:07:15,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 8451 transitions, 159887 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:07:15,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:07:15,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:07:15,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:08:40,394 INFO L124 PetriNetUnfolderBase]: 110435/167941 cut-off events. [2023-11-29 22:08:40,394 INFO L125 PetriNetUnfolderBase]: For 1033149/1213357 co-relation queries the response was YES. [2023-11-29 22:08:41,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285332 conditions, 167941 events. 110435/167941 cut-off events. For 1033149/1213357 co-relation queries the response was YES. Maximal size of possible extension queue 6385. Compared 1507857 event pairs, 7909 based on Foata normal form. 2027/147291 useless extension candidates. Maximal degree in co-relation 1108007. Up to 84434 conditions per place. [2023-11-29 22:08:43,065 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 6352 selfloop transitions, 734 changer transitions 1677/8883 dead transitions. [2023-11-29 22:08:43,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 8883 transitions, 185647 flow [2023-11-29 22:08:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:08:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:08:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2023-11-29 22:08:43,067 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8338870431893688 [2023-11-29 22:08:43,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2023-11-29 22:08:43,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2023-11-29 22:08:43,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:08:43,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2023-11-29 22:08:43,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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) [2023-11-29 22:08:43,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:08:43,070 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:08:43,070 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 70 predicate places. [2023-11-29 22:08:43,070 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 8883 transitions, 185647 flow [2023-11-29 22:08:43,070 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:08:43,070 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:08:43,071 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:08:43,071 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 22:08:43,071 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:08:43,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:08:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1837322477, now seen corresponding path program 6 times [2023-11-29 22:08:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:08:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536867691] [2023-11-29 22:08:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:08:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:08:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:08:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:08:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:08:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536867691] [2023-11-29 22:08:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536867691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:08:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:08:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:08:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301481995] [2023-11-29 22:08:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:08:43,119 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:08:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:08:43,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:08:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:08:43,120 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:08:43,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 8883 transitions, 185647 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:08:43,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:08:43,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:08:43,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:11:10,997 INFO L124 PetriNetUnfolderBase]: 149803/227413 cut-off events. [2023-11-29 22:11:10,997 INFO L125 PetriNetUnfolderBase]: For 1503961/1671832 co-relation queries the response was YES. [2023-11-29 22:11:12,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886757 conditions, 227413 events. 149803/227413 cut-off events. For 1503961/1671832 co-relation queries the response was YES. Maximal size of possible extension queue 7999. Compared 2074059 event pairs, 11255 based on Foata normal form. 2050/198688 useless extension candidates. Maximal degree in co-relation 1622369. Up to 113881 conditions per place. [2023-11-29 22:11:14,896 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 11693 selfloop transitions, 494 changer transitions 3485/15806 dead transitions. [2023-11-29 22:11:14,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 15806 transitions, 361850 flow [2023-11-29 22:11:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:11:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:11:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 759 transitions. [2023-11-29 22:11:14,897 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.840531561461794 [2023-11-29 22:11:14,898 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 759 transitions. [2023-11-29 22:11:14,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 759 transitions. [2023-11-29 22:11:14,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:11:14,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 759 transitions. [2023-11-29 22:11:14,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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) [2023-11-29 22:11:14,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:11:14,900 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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) [2023-11-29 22:11:14,901 INFO L307 CegarLoopForPetriNet]: 116 programPoint places, 76 predicate places. [2023-11-29 22:11:14,901 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 15806 transitions, 361850 flow [2023-11-29 22:11:14,901 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:11:14,901 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:11:14,901 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:11:14,901 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 22:11:14,901 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:11:14,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:11:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2097125, now seen corresponding path program 7 times [2023-11-29 22:11:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:11:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214177062] [2023-11-29 22:11:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:11:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:11:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:11:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:11:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:11:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214177062] [2023-11-29 22:11:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214177062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:11:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:11:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 22:11:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556107548] [2023-11-29 22:11:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:11:14,948 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 22:11:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:11:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 22:11:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 22:11:14,949 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-11-29 22:11:14,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 15806 transitions, 361850 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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) [2023-11-29 22:11:14,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:11:14,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-11-29 22:11:14,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 22:16:56,226 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 22:16:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 22:16:57,219 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-29 22:16:57,219 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 22:16:57,219 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1808791 conditions, 194822 events (129664/194821 cut-off events. For 2003394/2441618 co-relation queries the response was YES. Maximal size of possible extension queue 10777. Compared 1846633 event pairs, 5428 based on Foata normal form. 6919/180768 useless extension candidates. Maximal degree in co-relation 1709320. Up to 89522 conditions per place.). [2023-11-29 22:16:57,220 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-29 22:16:57,221 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-29 22:16:57,221 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-29 22:16:57,221 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-29 22:16:57,221 INFO L457 BasicCegarLoop]: Path program histogram: [7, 4, 1] [2023-11-29 22:16:57,223 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 22:16:57,223 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 22:16:57,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 10:16:57 BasicIcfg [2023-11-29 22:16:57,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 22:16:57,226 INFO L158 Benchmark]: Toolchain (without parser) took 762973.26ms. Allocated memory was 520.1MB in the beginning and 15.7GB in the end (delta: 15.2GB). Free memory was 473.6MB in the beginning and 10.1GB in the end (delta: -9.6GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-11-29 22:16:57,226 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 350.2MB. Free memory is still 305.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 22:16:57,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.79ms. Allocated memory is still 520.1MB. Free memory was 472.9MB in the beginning and 461.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-29 22:16:57,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.01ms. Allocated memory is still 520.1MB. Free memory was 461.8MB in the beginning and 460.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 22:16:57,230 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 520.1MB. Free memory was 460.2MB in the beginning and 458.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 22:16:57,230 INFO L158 Benchmark]: RCFGBuilder took 318.78ms. Allocated memory is still 520.1MB. Free memory was 458.2MB in the beginning and 438.7MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-29 22:16:57,230 INFO L158 Benchmark]: TraceAbstraction took 762417.26ms. Allocated memory was 520.1MB in the beginning and 15.7GB in the end (delta: 15.2GB). Free memory was 438.0MB in the beginning and 10.1GB in the end (delta: -9.6GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-11-29 22:16:57,231 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.10ms. Allocated memory is still 350.2MB. Free memory is still 305.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 178.79ms. Allocated memory is still 520.1MB. Free memory was 472.9MB in the beginning and 461.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.01ms. Allocated memory is still 520.1MB. Free memory was 461.8MB in the beginning and 460.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 520.1MB. Free memory was 460.2MB in the beginning and 458.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 318.78ms. Allocated memory is still 520.1MB. Free memory was 458.2MB in the beginning and 438.7MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 762417.26ms. Allocated memory was 520.1MB in the beginning and 15.7GB in the end (delta: 15.2GB). Free memory was 438.0MB in the beginning and 10.1GB in the end (delta: -9.6GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1808791 conditions, 194822 events (129664/194821 cut-off events. For 2003394/2441618 co-relation queries the response was YES. Maximal size of possible extension queue 10777. Compared 1846633 event pairs, 5428 based on Foata normal form. 6919/180768 useless extension candidates. Maximal degree in co-relation 1709320. Up to 89522 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1808791 conditions, 194822 events (129664/194821 cut-off events. For 2003394/2441618 co-relation queries the response was YES. Maximal size of possible extension queue 10777. Compared 1846633 event pairs, 5428 based on Foata normal form. 6919/180768 useless extension candidates. Maximal degree in co-relation 1709320. Up to 89522 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1808791 conditions, 194822 events (129664/194821 cut-off events. For 2003394/2441618 co-relation queries the response was YES. Maximal size of possible extension queue 10777. Compared 1846633 event pairs, 5428 based on Foata normal form. 6919/180768 useless extension candidates. Maximal degree in co-relation 1709320. Up to 89522 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1808791 conditions, 194822 events (129664/194821 cut-off events. For 2003394/2441618 co-relation queries the response was YES. Maximal size of possible extension queue 10777. Compared 1846633 event pairs, 5428 based on Foata normal form. 6919/180768 useless extension candidates. Maximal degree in co-relation 1709320. Up to 89522 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1808791 conditions, 194822 events (129664/194821 cut-off events. For 2003394/2441618 co-relation queries the response was YES. Maximal size of possible extension queue 10777. Compared 1846633 event pairs, 5428 based on Foata normal form. 6919/180768 useless extension candidates. Maximal degree in co-relation 1709320. Up to 89522 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 762.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 759.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 750 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2269 IncrementalHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 368 mSDtfsCounter, 2269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361850occurred in iteration=11, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1269 NumberOfCodeBlocks, 1269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1435 ConstructedInterpolants, 0 QuantifiedInterpolants, 2286 SizeOfPredicates, 8 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 9/15 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 RESULT: Ultimate could not prove your program: Timeout [2023-11-29 22:16:57,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Completed graceful shutdown