/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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/pthread-ext/09_fmaxsym.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:51:38,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:51:38,991 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-12-09 14:51:39,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:51:39,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:51:39,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:51:39,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:51:39,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:51:39,023 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:51:39,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:51:39,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:51:39,026 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:51:39,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:51:39,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:51:39,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:51:39,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:51:39,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:51:39,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:51:39,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:51:39,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:51:39,028 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:51:39,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:51:39,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:51:39,029 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:51:39,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:51:39,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:39,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:51:39,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:51:39,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:51:39,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:51:39,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:51:39,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:51:39,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:51:39,031 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-12-09 14:51:39,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:51:39,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:51:39,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:51:39,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:51:39,234 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:51:39,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2023-12-09 14:51:40,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:51:40,458 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:51:40,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2023-12-09 14:51:40,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb817eb6a/db38d3536d71487a8054ac638299c8b6/FLAGbe9b218e3 [2023-12-09 14:51:40,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb817eb6a/db38d3536d71487a8054ac638299c8b6 [2023-12-09 14:51:40,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:51:40,478 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:51:40,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:40,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:51:40,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:51:40,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e696baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40, skipping insertion in model container [2023-12-09 14:51:40,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:51:40,754 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i[30453,30466] [2023-12-09 14:51:40,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:40,774 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:51:40,807 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i[30453,30466] [2023-12-09 14:51:40,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:40,835 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:51:40,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40 WrapperNode [2023-12-09 14:51:40,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:40,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:40,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:51:40,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:51:40,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,872 INFO L138 Inliner]: procedures = 171, calls = 27, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 104 [2023-12-09 14:51:40,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:40,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:51:40,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:51:40,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:51:40,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:51:40,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:51:40,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:51:40,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:51:40,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (1/1) ... [2023-12-09 14:51:40,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:40,918 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-12-09 14:51:40,924 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-12-09 14:51:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 14:51:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:51:40,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:51:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:51:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:51:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:51:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:51:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:51:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:51:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:51:40,945 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 14:51:41,074 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:51:41,076 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:51:41,283 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:51:41,320 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:51:41,320 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 14:51:41,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:41 BoogieIcfgContainer [2023-12-09 14:51:41,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:51:41,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:51:41,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:51:41,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:51:41,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:51:40" (1/3) ... [2023-12-09 14:51:41,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199b5a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:41, skipping insertion in model container [2023-12-09 14:51:41,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:40" (2/3) ... [2023-12-09 14:51:41,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199b5a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:41, skipping insertion in model container [2023-12-09 14:51:41,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:41" (3/3) ... [2023-12-09 14:51:41,327 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2023-12-09 14:51:41,340 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:51:41,340 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 14:51:41,340 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:51:41,381 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:41,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 90 transitions, 184 flow [2023-12-09 14:51:41,448 INFO L124 PetriNetUnfolderBase]: 9/101 cut-off events. [2023-12-09 14:51:41,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:41,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 9/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 102 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-12-09 14:51:41,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 90 transitions, 184 flow [2023-12-09 14:51:41,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 90 transitions, 184 flow [2023-12-09 14:51:41,472 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:41,476 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;@dddb5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:41,476 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 14:51:41,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:41,488 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-12-09 14:51:41,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:41,488 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:41,489 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 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-12-09 14:51:41,489 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:41,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1053417641, now seen corresponding path program 1 times [2023-12-09 14:51:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004329327] [2023-12-09 14:51:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:41,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:41,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004329327] [2023-12-09 14:51:41,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004329327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:41,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:41,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687555941] [2023-12-09 14:51:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:41,749 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:41,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2023-12-09 14:51:41,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-12-09 14:51:41,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:41,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2023-12-09 14:51:41,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:41,863 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2023-12-09 14:51:41,864 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:51:41,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 89 events. 3/89 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 9/93 useless extension candidates. Maximal degree in co-relation 53. Up to 14 conditions per place. [2023-12-09 14:51:41,866 INFO L140 encePairwiseOnDemand]: 81/90 looper letters, 15 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-12-09 14:51:41,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 82 transitions, 202 flow [2023-12-09 14:51:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-12-09 14:51:41,880 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2023-12-09 14:51:41,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-12-09 14:51:41,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-12-09 14:51:41,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:41,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-12-09 14:51:41,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-12-09 14:51:41,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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-12-09 14:51:41,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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-12-09 14:51:41,890 INFO L308 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2023-12-09 14:51:41,891 INFO L500 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 202 flow [2023-12-09 14:51:41,891 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-12-09 14:51:41,891 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:41,891 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 14:51:41,891 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:51:41,892 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:41,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash -112639555, now seen corresponding path program 1 times [2023-12-09 14:51:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765123952] [2023-12-09 14:51:41,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:41,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765123952] [2023-12-09 14:51:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765123952] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:42,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244398053] [2023-12-09 14:51:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:42,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:42,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:42,032 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-12-09 14:51:42,056 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-12-09 14:51:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:42,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:42,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244398053] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:42,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:42,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:42,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52332849] [2023-12-09 14:51:42,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:42,222 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:42,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:42,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:42,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:42,226 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 90 [2023-12-09 14:51:42,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 202 flow. Second operand has 10 states, 10 states have (on average 70.2) internal successors, (702), 10 states have internal predecessors, (702), 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-12-09 14:51:42,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:42,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 90 [2023-12-09 14:51:42,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:42,319 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-12-09 14:51:42,319 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-12-09 14:51:42,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 99 events. 3/99 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 88. Up to 19 conditions per place. [2023-12-09 14:51:42,322 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 16 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2023-12-09 14:51:42,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 276 flow [2023-12-09 14:51:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 639 transitions. [2023-12-09 14:51:42,326 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2023-12-09 14:51:42,326 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 639 transitions. [2023-12-09 14:51:42,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 639 transitions. [2023-12-09 14:51:42,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:42,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 639 transitions. [2023-12-09 14:51:42,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 71.0) internal successors, (639), 9 states have internal predecessors, (639), 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-12-09 14:51:42,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 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-12-09 14:51:42,333 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 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-12-09 14:51:42,333 INFO L308 CegarLoopForPetriNet]: 85 programPoint places, 3 predicate places. [2023-12-09 14:51:42,333 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 276 flow [2023-12-09 14:51:42,334 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 70.2) internal successors, (702), 10 states have internal predecessors, (702), 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-12-09 14:51:42,334 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:42,334 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 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-12-09 14:51:42,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:42,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:42,539 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:42,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash -40094583, now seen corresponding path program 2 times [2023-12-09 14:51:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:42,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552541270] [2023-12-09 14:51:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552541270] [2023-12-09 14:51:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552541270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525522359] [2023-12-09 14:51:42,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:42,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:42,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:42,752 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-12-09 14:51:42,776 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-12-09 14:51:42,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:42,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:42,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:42,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:51:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525522359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:42,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408378284] [2023-12-09 14:51:42,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:42,970 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:42,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 90 [2023-12-09 14:51:42,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 276 flow. Second operand has 15 states, 15 states have (on average 70.46666666666667) internal successors, (1057), 15 states have internal predecessors, (1057), 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-12-09 14:51:42,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:42,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 90 [2023-12-09 14:51:42,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:43,123 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-12-09 14:51:43,123 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-12-09 14:51:43,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 123 events. 3/123 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 174. Up to 31 conditions per place. [2023-12-09 14:51:43,124 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 22 selfloop transitions, 18 changer transitions 0/104 dead transitions. [2023-12-09 14:51:43,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 440 flow [2023-12-09 14:51:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:51:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:51:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1267 transitions. [2023-12-09 14:51:43,127 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7820987654320988 [2023-12-09 14:51:43,127 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1267 transitions. [2023-12-09 14:51:43,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1267 transitions. [2023-12-09 14:51:43,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:43,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1267 transitions. [2023-12-09 14:51:43,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 70.38888888888889) internal successors, (1267), 18 states have internal predecessors, (1267), 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-12-09 14:51:43,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 90.0) internal successors, (1710), 19 states have internal predecessors, (1710), 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-12-09 14:51:43,134 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 90.0) internal successors, (1710), 19 states have internal predecessors, (1710), 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-12-09 14:51:43,135 INFO L308 CegarLoopForPetriNet]: 85 programPoint places, 20 predicate places. [2023-12-09 14:51:43,135 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 440 flow [2023-12-09 14:51:43,135 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.46666666666667) internal successors, (1057), 15 states have internal predecessors, (1057), 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-12-09 14:51:43,135 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:43,135 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 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-12-09 14:51:43,142 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-12-09 14:51:43,342 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,SelfDestructingSolverStorable2 [2023-12-09 14:51:43,343 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:43,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1346219077, now seen corresponding path program 3 times [2023-12-09 14:51:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959749542] [2023-12-09 14:51:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:43,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:43,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:43,425 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:43,426 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-09 14:51:43,428 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-09 14:51:43,428 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-09 14:51:43,428 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:51:43,429 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-09 14:51:43,431 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:43,431 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:51:43,461 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:43,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 135 transitions, 280 flow [2023-12-09 14:51:43,483 INFO L124 PetriNetUnfolderBase]: 15/159 cut-off events. [2023-12-09 14:51:43,484 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:51:43,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 159 events. 15/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 268 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 102. Up to 6 conditions per place. [2023-12-09 14:51:43,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 135 transitions, 280 flow [2023-12-09 14:51:43,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 135 transitions, 280 flow [2023-12-09 14:51:43,488 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:43,490 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;@dddb5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:43,490 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:51:43,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:43,496 INFO L124 PetriNetUnfolderBase]: 6/92 cut-off events. [2023-12-09 14:51:43,496 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:51:43,496 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:43,496 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 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-12-09 14:51:43,496 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:43,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -675889950, now seen corresponding path program 1 times [2023-12-09 14:51:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78860904] [2023-12-09 14:51:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:43,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78860904] [2023-12-09 14:51:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78860904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:43,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:43,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704554408] [2023-12-09 14:51:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:43,535 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:43,536 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 135 [2023-12-09 14:51:43,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 135 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-12-09 14:51:43,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:43,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 135 [2023-12-09 14:51:43,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:43,603 INFO L124 PetriNetUnfolderBase]: 36/344 cut-off events. [2023-12-09 14:51:43,603 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-09 14:51:43,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 344 events. 36/344 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1201 event pairs, 20 based on Foata normal form. 63/374 useless extension candidates. Maximal degree in co-relation 175. Up to 66 conditions per place. [2023-12-09 14:51:43,607 INFO L140 encePairwiseOnDemand]: 123/135 looper letters, 20 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2023-12-09 14:51:43,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 123 transitions, 300 flow [2023-12-09 14:51:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-12-09 14:51:43,608 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2023-12-09 14:51:43,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-12-09 14:51:43,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-12-09 14:51:43,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:43,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-12-09 14:51:43,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12-09 14:51:43,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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-12-09 14:51:43,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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-12-09 14:51:43,612 INFO L308 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2023-12-09 14:51:43,612 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 300 flow [2023-12-09 14:51:43,613 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-12-09 14:51:43,615 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:43,615 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 14:51:43,615 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:51:43,616 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:43,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1579497532, now seen corresponding path program 1 times [2023-12-09 14:51:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817569153] [2023-12-09 14:51:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817569153] [2023-12-09 14:51:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817569153] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950543659] [2023-12-09 14:51:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:43,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:43,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 14:51:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:43,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:43,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:43,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950543659] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:43,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958274952] [2023-12-09 14:51:43,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:43,822 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:43,824 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2023-12-09 14:51:43,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 300 flow. Second operand has 10 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 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-12-09 14:51:43,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:43,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2023-12-09 14:51:43,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:43,929 INFO L124 PetriNetUnfolderBase]: 36/354 cut-off events. [2023-12-09 14:51:43,929 INFO L125 PetriNetUnfolderBase]: For 59/75 co-relation queries the response was YES. [2023-12-09 14:51:43,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 354 events. 36/354 cut-off events. For 59/75 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1189 event pairs, 20 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 204. Up to 71 conditions per place. [2023-12-09 14:51:43,931 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 21 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2023-12-09 14:51:43,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 130 transitions, 384 flow [2023-12-09 14:51:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 968 transitions. [2023-12-09 14:51:43,933 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7967078189300412 [2023-12-09 14:51:43,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 968 transitions. [2023-12-09 14:51:43,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 968 transitions. [2023-12-09 14:51:43,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:43,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 968 transitions. [2023-12-09 14:51:43,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 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-12-09 14:51:43,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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-12-09 14:51:43,937 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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-12-09 14:51:43,938 INFO L308 CegarLoopForPetriNet]: 127 programPoint places, 2 predicate places. [2023-12-09 14:51:43,938 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 384 flow [2023-12-09 14:51:43,939 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 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-12-09 14:51:43,939 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:43,939 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 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-12-09 14:51:43,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:44,143 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:44,143 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:44,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2076721392, now seen corresponding path program 2 times [2023-12-09 14:51:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545450775] [2023-12-09 14:51:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:44,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545450775] [2023-12-09 14:51:44,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545450775] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:44,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584518189] [2023-12-09 14:51:44,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:44,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:44,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:44,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:44,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 14:51:44,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:44,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:44,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:44,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-09 14:51:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584518189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:44,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:44,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051734810] [2023-12-09 14:51:44,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:44,398 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:44,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:44,400 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2023-12-09 14:51:44,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 384 flow. Second operand has 15 states, 15 states have (on average 106.53333333333333) internal successors, (1598), 15 states have internal predecessors, (1598), 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-12-09 14:51:44,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:44,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2023-12-09 14:51:44,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:44,537 INFO L124 PetriNetUnfolderBase]: 36/378 cut-off events. [2023-12-09 14:51:44,537 INFO L125 PetriNetUnfolderBase]: For 154/186 co-relation queries the response was YES. [2023-12-09 14:51:44,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 378 events. 36/378 cut-off events. For 154/186 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1192 event pairs, 20 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 238. Up to 83 conditions per place. [2023-12-09 14:51:44,539 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 27 selfloop transitions, 18 changer transitions 0/145 dead transitions. [2023-12-09 14:51:44,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 145 transitions, 558 flow [2023-12-09 14:51:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:51:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:51:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1920 transitions. [2023-12-09 14:51:44,542 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7901234567901234 [2023-12-09 14:51:44,543 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1920 transitions. [2023-12-09 14:51:44,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1920 transitions. [2023-12-09 14:51:44,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:44,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1920 transitions. [2023-12-09 14:51:44,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 106.66666666666667) internal successors, (1920), 18 states have internal predecessors, (1920), 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-12-09 14:51:44,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 135.0) internal successors, (2565), 19 states have internal predecessors, (2565), 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-12-09 14:51:44,551 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 135.0) internal successors, (2565), 19 states have internal predecessors, (2565), 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-12-09 14:51:44,552 INFO L308 CegarLoopForPetriNet]: 127 programPoint places, 19 predicate places. [2023-12-09 14:51:44,552 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 558 flow [2023-12-09 14:51:44,554 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 106.53333333333333) internal successors, (1598), 15 states have internal predecessors, (1598), 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-12-09 14:51:44,554 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:44,554 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 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-12-09 14:51:44,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:44,758 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:44,758 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:44,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1597111038, now seen corresponding path program 3 times [2023-12-09 14:51:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626199424] [2023-12-09 14:51:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:44,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:44,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:44,802 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:44,803 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:51:44,803 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:51:44,803 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-09 14:51:44,803 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:51:44,803 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:51:44,803 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-09 14:51:44,804 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:44,804 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:51:44,828 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 180 transitions, 378 flow [2023-12-09 14:51:44,858 INFO L124 PetriNetUnfolderBase]: 21/217 cut-off events. [2023-12-09 14:51:44,858 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:51:44,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 217 events. 21/217 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 519 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 163. Up to 8 conditions per place. [2023-12-09 14:51:44,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 180 transitions, 378 flow [2023-12-09 14:51:44,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 180 transitions, 378 flow [2023-12-09 14:51:44,861 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:44,861 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;@dddb5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:44,861 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:51:44,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:44,868 INFO L124 PetriNetUnfolderBase]: 9/133 cut-off events. [2023-12-09 14:51:44,868 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:51:44,868 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:44,868 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 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-12-09 14:51:44,869 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:44,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1488743370, now seen corresponding path program 1 times [2023-12-09 14:51:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629402685] [2023-12-09 14:51:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629402685] [2023-12-09 14:51:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629402685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:44,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:44,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294041893] [2023-12-09 14:51:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:44,891 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:44,893 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2023-12-09 14:51:44,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 180 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-12-09 14:51:44,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:44,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2023-12-09 14:51:44,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:45,067 INFO L124 PetriNetUnfolderBase]: 320/1719 cut-off events. [2023-12-09 14:51:45,068 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2023-12-09 14:51:45,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 1719 events. 320/1719 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12822 event pairs, 220 based on Foata normal form. 419/1933 useless extension candidates. Maximal degree in co-relation 610. Up to 457 conditions per place. [2023-12-09 14:51:45,084 INFO L140 encePairwiseOnDemand]: 165/180 looper letters, 25 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-12-09 14:51:45,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 164 transitions, 400 flow [2023-12-09 14:51:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-12-09 14:51:45,086 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2023-12-09 14:51:45,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-12-09 14:51:45,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-12-09 14:51:45,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:45,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-12-09 14:51:45,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-12-09 14:51:45,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-12-09 14:51:45,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-12-09 14:51:45,088 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -7 predicate places. [2023-12-09 14:51:45,088 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 164 transitions, 400 flow [2023-12-09 14:51:45,089 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-12-09 14:51:45,089 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:45,089 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 14:51:45,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:51:45,089 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:45,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1124931996, now seen corresponding path program 1 times [2023-12-09 14:51:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329489919] [2023-12-09 14:51:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329489919] [2023-12-09 14:51:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329489919] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942240132] [2023-12-09 14:51:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:45,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:45,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 14:51:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:45,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:45,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942240132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:45,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:45,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283053304] [2023-12-09 14:51:45,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:45,253 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:45,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:45,254 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 180 [2023-12-09 14:51:45,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 164 transitions, 400 flow. Second operand has 10 states, 10 states have (on average 142.4) internal successors, (1424), 10 states have internal predecessors, (1424), 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-12-09 14:51:45,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:45,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 180 [2023-12-09 14:51:45,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:45,512 INFO L124 PetriNetUnfolderBase]: 320/1729 cut-off events. [2023-12-09 14:51:45,513 INFO L125 PetriNetUnfolderBase]: For 414/704 co-relation queries the response was YES. [2023-12-09 14:51:45,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1729 events. 320/1729 cut-off events. For 414/704 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12833 event pairs, 220 based on Foata normal form. 0/1524 useless extension candidates. Maximal degree in co-relation 744. Up to 462 conditions per place. [2023-12-09 14:51:45,533 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 26 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2023-12-09 14:51:45,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 494 flow [2023-12-09 14:51:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:51:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:51:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1297 transitions. [2023-12-09 14:51:45,536 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8006172839506173 [2023-12-09 14:51:45,536 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1297 transitions. [2023-12-09 14:51:45,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1297 transitions. [2023-12-09 14:51:45,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:45,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1297 transitions. [2023-12-09 14:51:45,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.11111111111111) internal successors, (1297), 9 states have internal predecessors, (1297), 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-12-09 14:51:45,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 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-12-09 14:51:45,541 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 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-12-09 14:51:45,541 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2023-12-09 14:51:45,541 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 171 transitions, 494 flow [2023-12-09 14:51:45,541 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 142.4) internal successors, (1424), 10 states have internal predecessors, (1424), 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-12-09 14:51:45,541 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:45,542 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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-12-09 14:51:45,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:45,745 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-09 14:51:45,746 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:45,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash -191638936, now seen corresponding path program 2 times [2023-12-09 14:51:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136657946] [2023-12-09 14:51:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136657946] [2023-12-09 14:51:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136657946] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103425445] [2023-12-09 14:51:45,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:51:45,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:45,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:45,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 14:51:45,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:51:45,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:51:45,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:51:45,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:45,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-09 14:51:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103425445] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:46,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:51:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913001723] [2023-12-09 14:51:46,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:46,056 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:51:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:51:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:51:46,059 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 180 [2023-12-09 14:51:46,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 494 flow. Second operand has 15 states, 15 states have (on average 142.6) internal successors, (2139), 15 states have internal predecessors, (2139), 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-12-09 14:51:46,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:46,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 180 [2023-12-09 14:51:46,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:46,439 INFO L124 PetriNetUnfolderBase]: 320/1753 cut-off events. [2023-12-09 14:51:46,439 INFO L125 PetriNetUnfolderBase]: For 856/1436 co-relation queries the response was YES. [2023-12-09 14:51:46,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 1753 events. 320/1753 cut-off events. For 856/1436 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12800 event pairs, 220 based on Foata normal form. 0/1548 useless extension candidates. Maximal degree in co-relation 878. Up to 474 conditions per place. [2023-12-09 14:51:46,460 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 32 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2023-12-09 14:51:46,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 186 transitions, 678 flow [2023-12-09 14:51:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:51:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:51:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2573 transitions. [2023-12-09 14:51:46,465 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7941358024691358 [2023-12-09 14:51:46,465 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2573 transitions. [2023-12-09 14:51:46,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2573 transitions. [2023-12-09 14:51:46,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:46,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2573 transitions. [2023-12-09 14:51:46,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 142.94444444444446) internal successors, (2573), 18 states have internal predecessors, (2573), 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-12-09 14:51:46,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 180.0) internal successors, (3420), 19 states have internal predecessors, (3420), 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-12-09 14:51:46,474 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 180.0) internal successors, (3420), 19 states have internal predecessors, (3420), 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-12-09 14:51:46,475 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 18 predicate places. [2023-12-09 14:51:46,475 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 678 flow [2023-12-09 14:51:46,475 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 142.6) internal successors, (2139), 15 states have internal predecessors, (2139), 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-12-09 14:51:46,475 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:46,476 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 1, 1, 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-12-09 14:51:46,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:46,680 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:46,680 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:46,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -705095014, now seen corresponding path program 3 times [2023-12-09 14:51:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213890989] [2023-12-09 14:51:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:46,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:46,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:46,714 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:46,714 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-09 14:51:46,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:51:46,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-09 14:51:46,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:51:46,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:51:46,715 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 14:51:46,715 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-09 14:51:46,716 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:46,716 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 14:51:46,741 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:46,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 225 transitions, 478 flow [2023-12-09 14:51:46,768 INFO L124 PetriNetUnfolderBase]: 27/275 cut-off events. [2023-12-09 14:51:46,768 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 14:51:46,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 275 events. 27/275 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 772 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 225. Up to 10 conditions per place. [2023-12-09 14:51:46,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 225 transitions, 478 flow [2023-12-09 14:51:46,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 225 transitions, 478 flow [2023-12-09 14:51:46,774 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:46,775 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;@dddb5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:46,775 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:51:46,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:46,787 INFO L124 PetriNetUnfolderBase]: 13/174 cut-off events. [2023-12-09 14:51:46,787 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-12-09 14:51:46,787 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:46,788 INFO L233 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] [2023-12-09 14:51:46,788 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:46,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1454040017, now seen corresponding path program 1 times [2023-12-09 14:51:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187943612] [2023-12-09 14:51:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:51:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:46,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187943612] [2023-12-09 14:51:46,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187943612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575454437] [2023-12-09 14:51:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:46,818 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:46,819 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 225 [2023-12-09 14:51:46,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 225 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-12-09 14:51:46,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:46,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 225 [2023-12-09 14:51:46,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:47,977 INFO L124 PetriNetUnfolderBase]: 2347/9144 cut-off events. [2023-12-09 14:51:47,977 INFO L125 PetriNetUnfolderBase]: For 1578/1578 co-relation queries the response was YES. [2023-12-09 14:51:48,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12950 conditions, 9144 events. 2347/9144 cut-off events. For 1578/1578 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 97663 event pairs, 1720 based on Foata normal form. 2653/10599 useless extension candidates. Maximal degree in co-relation 2287. Up to 3055 conditions per place. [2023-12-09 14:51:48,060 INFO L140 encePairwiseOnDemand]: 207/225 looper letters, 30 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2023-12-09 14:51:48,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 205 transitions, 502 flow [2023-12-09 14:51:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-12-09 14:51:48,061 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2023-12-09 14:51:48,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-12-09 14:51:48,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-12-09 14:51:48,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:48,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-12-09 14:51:48,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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-12-09 14:51:48,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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-12-09 14:51:48,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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-12-09 14:51:48,064 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -8 predicate places. [2023-12-09 14:51:48,065 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 205 transitions, 502 flow [2023-12-09 14:51:48,065 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-12-09 14:51:48,065 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:48,065 INFO L233 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] [2023-12-09 14:51:48,065 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 14:51:48,065 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:48,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1482793579, now seen corresponding path program 1 times [2023-12-09 14:51:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315172916] [2023-12-09 14:51:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:51:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315172916] [2023-12-09 14:51:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315172916] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21903094] [2023-12-09 14:51:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:48,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:48,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:48,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:48,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 14:51:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:48,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-09 14:51:48,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 14:51:48,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:51:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21903094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:48,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:51:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-09 14:51:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810435331] [2023-12-09 14:51:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:48,214 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 14:51:48,215 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 225 [2023-12-09 14:51:48,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 205 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-12-09 14:51:48,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:48,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 225 [2023-12-09 14:51:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:57,689 INFO L124 PetriNetUnfolderBase]: 51167/90638 cut-off events. [2023-12-09 14:51:57,689 INFO L125 PetriNetUnfolderBase]: For 35027/438753 co-relation queries the response was YES. [2023-12-09 14:51:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195256 conditions, 90638 events. 51167/90638 cut-off events. For 35027/438753 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 883595 event pairs, 23384 based on Foata normal form. 0/72538 useless extension candidates. Maximal degree in co-relation 95372. Up to 47916 conditions per place. [2023-12-09 14:51:58,771 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 73 selfloop transitions, 8 changer transitions 0/241 dead transitions. [2023-12-09 14:51:58,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 241 transitions, 793 flow [2023-12-09 14:51:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2023-12-09 14:51:58,773 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.837037037037037 [2023-12-09 14:51:58,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2023-12-09 14:51:58,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2023-12-09 14:51:58,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:58,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2023-12-09 14:51:58,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-12-09 14:51:58,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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-12-09 14:51:58,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 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-12-09 14:51:58,777 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -6 predicate places. [2023-12-09 14:51:58,777 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 241 transitions, 793 flow [2023-12-09 14:51:58,777 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-12-09 14:51:58,777 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:58,778 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 14:51:58,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 14:51:58,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:58,982 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:51:58,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2087310248, now seen corresponding path program 1 times [2023-12-09 14:51:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004043802] [2023-12-09 14:51:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:59,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004043802] [2023-12-09 14:51:59,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004043802] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772988763] [2023-12-09 14:51:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:59,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:59,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:59,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:51:59,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 14:51:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:59,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:51:59,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:59,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:51:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772988763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:59,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:59,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:51:59,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161311718] [2023-12-09 14:51:59,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:59,140 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:51:59,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:59,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:51:59,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:51:59,142 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 225 [2023-12-09 14:51:59,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 241 transitions, 793 flow. Second operand has 10 states, 10 states have (on average 178.5) internal successors, (1785), 10 states have internal predecessors, (1785), 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-12-09 14:51:59,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:59,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 225 [2023-12-09 14:51:59,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:09,407 INFO L124 PetriNetUnfolderBase]: 51167/90648 cut-off events. [2023-12-09 14:52:09,408 INFO L125 PetriNetUnfolderBase]: For 74654/882106 co-relation queries the response was YES. [2023-12-09 14:52:09,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226108 conditions, 90648 events. 51167/90648 cut-off events. For 74654/882106 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 883554 event pairs, 23384 based on Foata normal form. 0/72548 useless extension candidates. Maximal degree in co-relation 110470. Up to 47916 conditions per place. [2023-12-09 14:52:10,597 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 49 selfloop transitions, 9 changer transitions 0/248 dead transitions. [2023-12-09 14:52:10,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 248 transitions, 933 flow [2023-12-09 14:52:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:52:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:52:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1626 transitions. [2023-12-09 14:52:10,603 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.802962962962963 [2023-12-09 14:52:10,603 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1626 transitions. [2023-12-09 14:52:10,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1626 transitions. [2023-12-09 14:52:10,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:10,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1626 transitions. [2023-12-09 14:52:10,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 180.66666666666666) internal successors, (1626), 9 states have internal predecessors, (1626), 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-12-09 14:52:10,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 225.0) internal successors, (2250), 10 states have internal predecessors, (2250), 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-12-09 14:52:10,621 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 225.0) internal successors, (2250), 10 states have internal predecessors, (2250), 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-12-09 14:52:10,623 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, 2 predicate places. [2023-12-09 14:52:10,623 INFO L500 AbstractCegarLoop]: Abstraction has has 213 places, 248 transitions, 933 flow [2023-12-09 14:52:10,623 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.5) internal successors, (1785), 10 states have internal predecessors, (1785), 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-12-09 14:52:10,623 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:10,623 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-12-09 14:52:10,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 14:52:10,828 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-09 14:52:10,828 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:52:10,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 345881692, now seen corresponding path program 2 times [2023-12-09 14:52:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985777100] [2023-12-09 14:52:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:52:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985777100] [2023-12-09 14:52:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985777100] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:52:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644883025] [2023-12-09 14:52:11,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:52:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:52:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:52:11,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:52:11,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 14:52:11,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:52:11,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:52:11,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:52:11,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:52:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:52:11,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:52:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-09 14:52:11,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644883025] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:52:11,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:52:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-12-09 14:52:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471630065] [2023-12-09 14:52:11,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:52:11,204 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 14:52:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 14:52:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-09 14:52:11,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 225 [2023-12-09 14:52:11,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 248 transitions, 933 flow. Second operand has 15 states, 15 states have (on average 178.66666666666666) internal successors, (2680), 15 states have internal predecessors, (2680), 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-12-09 14:52:11,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:11,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 225 [2023-12-09 14:52:11,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:22,751 INFO L124 PetriNetUnfolderBase]: 51167/90672 cut-off events. [2023-12-09 14:52:22,752 INFO L125 PetriNetUnfolderBase]: For 133390/1311096 co-relation queries the response was YES. [2023-12-09 14:52:23,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257011 conditions, 90672 events. 51167/90672 cut-off events. For 133390/1311096 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 883656 event pairs, 23384 based on Foata normal form. 0/72572 useless extension candidates. Maximal degree in co-relation 125568. Up to 47916 conditions per place. [2023-12-09 14:52:24,228 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 55 selfloop transitions, 18 changer transitions 0/263 dead transitions. [2023-12-09 14:52:24,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 263 transitions, 1163 flow [2023-12-09 14:52:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 14:52:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 14:52:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3226 transitions. [2023-12-09 14:52:24,246 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7965432098765433 [2023-12-09 14:52:24,246 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3226 transitions. [2023-12-09 14:52:24,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3226 transitions. [2023-12-09 14:52:24,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:24,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3226 transitions. [2023-12-09 14:52:24,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 179.22222222222223) internal successors, (3226), 18 states have internal predecessors, (3226), 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-12-09 14:52:24,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 225.0) internal successors, (4275), 19 states have internal predecessors, (4275), 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-12-09 14:52:24,268 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 225.0) internal successors, (4275), 19 states have internal predecessors, (4275), 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-12-09 14:52:24,269 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, 19 predicate places. [2023-12-09 14:52:24,269 INFO L500 AbstractCegarLoop]: Abstraction has has 230 places, 263 transitions, 1163 flow [2023-12-09 14:52:24,269 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.66666666666666) internal successors, (2680), 15 states have internal predecessors, (2680), 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-12-09 14:52:24,269 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:24,270 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 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-12-09 14:52:24,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-09 14:52:24,470 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-09 14:52:24,470 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:52:24,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 471385706, now seen corresponding path program 3 times [2023-12-09 14:52:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330753903] [2023-12-09 14:52:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:24,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:52:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:24,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:52:24,515 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:52:24,515 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-09 14:52:24,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:52:24,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-09 14:52:24,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-09 14:52:24,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:52:24,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:52:24,515 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-09 14:52:24,515 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-12-09 14:52:24,516 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:52:24,516 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-09 14:52:24,586 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:24,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 270 transitions, 580 flow [2023-12-09 14:52:24,642 INFO L124 PetriNetUnfolderBase]: 33/333 cut-off events. [2023-12-09 14:52:24,642 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-09 14:52:24,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 333 events. 33/333 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1019 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 288. Up to 12 conditions per place. [2023-12-09 14:52:24,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 270 transitions, 580 flow [2023-12-09 14:52:24,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 270 transitions, 580 flow [2023-12-09 14:52:24,647 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:24,647 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;@dddb5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:24,647 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-09 14:52:24,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:24,659 INFO L124 PetriNetUnfolderBase]: 13/175 cut-off events. [2023-12-09 14:52:24,659 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-12-09 14:52:24,659 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:24,659 INFO L233 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] [2023-12-09 14:52:24,659 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:52:24,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash -894339305, now seen corresponding path program 1 times [2023-12-09 14:52:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486141712] [2023-12-09 14:52:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:24,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486141712] [2023-12-09 14:52:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486141712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:24,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:24,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580957452] [2023-12-09 14:52:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:24,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:24,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:24,697 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 270 [2023-12-09 14:52:24,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 270 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-12-09 14:52:24,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:24,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 270 [2023-12-09 14:52:24,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:32,177 INFO L124 PetriNetUnfolderBase]: 15589/49331 cut-off events. [2023-12-09 14:52:32,177 INFO L125 PetriNetUnfolderBase]: For 11961/11961 co-relation queries the response was YES. [2023-12-09 14:52:32,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73021 conditions, 49331 events. 15589/49331 cut-off events. For 11961/11961 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 650428 event pairs, 11720 based on Foata normal form. 16292/59307 useless extension candidates. Maximal degree in co-relation 13053. Up to 19188 conditions per place. [2023-12-09 14:52:33,078 INFO L140 encePairwiseOnDemand]: 249/270 looper letters, 35 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2023-12-09 14:52:33,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 246 transitions, 606 flow [2023-12-09 14:52:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2023-12-09 14:52:33,079 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2023-12-09 14:52:33,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 696 transitions. [2023-12-09 14:52:33,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 696 transitions. [2023-12-09 14:52:33,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:33,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 696 transitions. [2023-12-09 14:52:33,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-12-09 14:52:33,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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-12-09 14:52:33,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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-12-09 14:52:33,082 INFO L308 CegarLoopForPetriNet]: 253 programPoint places, -9 predicate places. [2023-12-09 14:52:33,082 INFO L500 AbstractCegarLoop]: Abstraction has has 244 places, 246 transitions, 606 flow [2023-12-09 14:52:33,082 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-12-09 14:52:33,082 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:33,082 INFO L233 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] [2023-12-09 14:52:33,082 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-09 14:52:33,082 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:52:33,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash -451977347, now seen corresponding path program 1 times [2023-12-09 14:52:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773616127] [2023-12-09 14:52:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:33,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773616127] [2023-12-09 14:52:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773616127] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:52:33,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770784780] [2023-12-09 14:52:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:52:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:52:33,129 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:52:33,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-09 14:52:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:33,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-09 14:52:33,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:52:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 14:52:33,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:52:33,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770784780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:33,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:52:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-09 14:52:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082504664] [2023-12-09 14:52:33,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:33,247 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:33,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 14:52:33,249 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 270 [2023-12-09 14:52:33,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 246 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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-12-09 14:52:33,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:33,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 270 [2023-12-09 14:52:33,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand