/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:47:42,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:47:42,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:47:42,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:47:42,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:47:42,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:47:42,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:47:42,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:47:42,977 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:47:42,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:47:42,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:47:42,982 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:47:42,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:47:42,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:47:42,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:47:42,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:47:42,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:47:42,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:47:42,985 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:47:42,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:47:42,985 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:47:42,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:47:42,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:47:42,987 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:47:42,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:47:42,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:47:42,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:47:42,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:47:42,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:47:42,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:47:42,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:47:42,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:47:42,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:47:42,990 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 [2023-11-10 11:47:43,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:47:43,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:47:43,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:47:43,228 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:47:43,229 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:47:43,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:47:44,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:47:44,613 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:47:44,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:47:44,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9483ba09/6e5e0b06fb254e9c8f6e25613651f6b0/FLAGbb4f30091 [2023-11-10 11:47:44,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9483ba09/6e5e0b06fb254e9c8f6e25613651f6b0 [2023-11-10 11:47:44,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:47:44,654 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:47:44,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:47:44,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:47:44,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:47:44,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:47:44" (1/1) ... [2023-11-10 11:47:44,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed7d90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:44, skipping insertion in model container [2023-11-10 11:47:44,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:47:44" (1/1) ... [2023-11-10 11:47:44,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:47:44,857 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-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-10 11:47:45,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:47:45,120 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:47:45,133 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-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-10 11:47:45,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:47:45,206 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:47:45,207 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:47:45,214 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:47:45,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45 WrapperNode [2023-11-10 11:47:45,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:47:45,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:47:45,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:47:45,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:47:45,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,274 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-10 11:47:45,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:47:45,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:47:45,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:47:45,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:47:45,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:47:45,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:47:45,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:47:45,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:47:45,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (1/1) ... [2023-11-10 11:47:45,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:47:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:47:45,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:47:45,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:47:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:47:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:47:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:47:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:47:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:47:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:47:45,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:47:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:47:45,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:47:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:47:45,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:47:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:47:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:47:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:47:45,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:47:45,421 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:47:45,590 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:47:45,595 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:47:46,006 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:47:46,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:47:46,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:47:46,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:47:46 BoogieIcfgContainer [2023-11-10 11:47:46,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:47:46,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:47:46,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:47:46,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:47:46,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:47:44" (1/3) ... [2023-11-10 11:47:46,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:47:46, skipping insertion in model container [2023-11-10 11:47:46,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:45" (2/3) ... [2023-11-10 11:47:46,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:47:46, skipping insertion in model container [2023-11-10 11:47:46,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:47:46" (3/3) ... [2023-11-10 11:47:46,171 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:47:46,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:47:46,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:47:46,185 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:47:46,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:47:46,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 236 flow [2023-11-10 11:47:46,325 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-10 11:47:46,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:47:46,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-10 11:47:46,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 236 flow [2023-11-10 11:47:46,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-11-10 11:47:46,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:47:46,357 INFO L357 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=false, 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;@1b3c1b8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:47:46,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-10 11:47:46,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:47:46,381 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-10 11:47:46,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:47:46,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:46,382 INFO L208 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] [2023-11-10 11:47:46,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:46,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1360690426, now seen corresponding path program 1 times [2023-11-10 11:47:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:46,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88256035] [2023-11-10 11:47:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88256035] [2023-11-10 11:47:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88256035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:47:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770419515] [2023-11-10 11:47:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:46,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:47:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:47,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:47:47,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:47:47,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2023-11-10 11:47:47,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:47,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:47,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2023-11-10 11:47:47,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:47,370 INFO L124 PetriNetUnfolderBase]: 210/1234 cut-off events. [2023-11-10 11:47:47,370 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-10 11:47:47,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 1234 events. 210/1234 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9557 event pairs, 114 based on Foata normal form. 44/1193 useless extension candidates. Maximal degree in co-relation 1560. Up to 245 conditions per place. [2023-11-10 11:47:47,386 INFO L140 encePairwiseOnDemand]: 107/112 looper letters, 19 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2023-11-10 11:47:47,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 280 flow [2023-11-10 11:47:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:47:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:47:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-10 11:47:47,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2023-11-10 11:47:47,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-10 11:47:47,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-10 11:47:47,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:47,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-10 11:47:47,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:47,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:47,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:47,417 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 311 transitions. [2023-11-10 11:47:47,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 280 flow [2023-11-10 11:47:47,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-10 11:47:47,428 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2023-11-10 11:47:47,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2023-11-10 11:47:47,434 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2023-11-10 11:47:47,435 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2023-11-10 11:47:47,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:47,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:47,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:47,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:47:47,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:47,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1567381928, now seen corresponding path program 1 times [2023-11-10 11:47:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384938318] [2023-11-10 11:47:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384938318] [2023-11-10 11:47:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384938318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:47:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204190966] [2023-11-10 11:47:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:48,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:47:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:47:48,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:47:48,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 112 [2023-11-10 11:47:48,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:48,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:48,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 112 [2023-11-10 11:47:48,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:49,693 INFO L124 PetriNetUnfolderBase]: 1508/3377 cut-off events. [2023-11-10 11:47:49,693 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-10 11:47:49,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5943 conditions, 3377 events. 1508/3377 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25060 event pairs, 225 based on Foata normal form. 0/3294 useless extension candidates. Maximal degree in co-relation 5886. Up to 721 conditions per place. [2023-11-10 11:47:49,714 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 35 selfloop transitions, 2 changer transitions 68/168 dead transitions. [2023-11-10 11:47:49,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 168 transitions, 554 flow [2023-11-10 11:47:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:47:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:47:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 781 transitions. [2023-11-10 11:47:49,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7748015873015873 [2023-11-10 11:47:49,718 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 781 transitions. [2023-11-10 11:47:49,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 781 transitions. [2023-11-10 11:47:49,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:49,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 781 transitions. [2023-11-10 11:47:49,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 86.77777777777777) internal successors, (781), 9 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:49,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:49,725 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:49,725 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 781 transitions. [2023-11-10 11:47:49,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 168 transitions, 554 flow [2023-11-10 11:47:49,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 168 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:47:49,729 INFO L231 Difference]: Finished difference. Result has 127 places, 92 transitions, 210 flow [2023-11-10 11:47:49,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=127, PETRI_TRANSITIONS=92} [2023-11-10 11:47:49,731 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2023-11-10 11:47:49,731 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 92 transitions, 210 flow [2023-11-10 11:47:49,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:49,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:49,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:49,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:47:49,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:49,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1580921002, now seen corresponding path program 1 times [2023-11-10 11:47:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031524386] [2023-11-10 11:47:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031524386] [2023-11-10 11:47:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031524386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:51,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:51,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:47:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297699237] [2023-11-10 11:47:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:51,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:47:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:47:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:47:51,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 112 [2023-11-10 11:47:51,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 92 transitions, 210 flow. Second operand has 13 states, 13 states have (on average 75.92307692307692) internal successors, (987), 13 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:51,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:51,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 112 [2023-11-10 11:47:51,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:52,464 INFO L124 PetriNetUnfolderBase]: 629/1314 cut-off events. [2023-11-10 11:47:52,465 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-11-10 11:47:52,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 1314 events. 629/1314 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7157 event pairs, 78 based on Foata normal form. 28/1271 useless extension candidates. Maximal degree in co-relation 2607. Up to 545 conditions per place. [2023-11-10 11:47:52,475 INFO L140 encePairwiseOnDemand]: 94/112 looper letters, 40 selfloop transitions, 19 changer transitions 70/190 dead transitions. [2023-11-10 11:47:52,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 190 transitions, 730 flow [2023-11-10 11:47:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-10 11:47:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-10 11:47:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1910 transitions. [2023-11-10 11:47:52,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7105654761904762 [2023-11-10 11:47:52,481 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1910 transitions. [2023-11-10 11:47:52,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1910 transitions. [2023-11-10 11:47:52,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:52,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1910 transitions. [2023-11-10 11:47:52,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 79.58333333333333) internal successors, (1910), 24 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:52,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 112.0) internal successors, (2800), 25 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:52,494 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 112.0) internal successors, (2800), 25 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:52,495 INFO L175 Difference]: Start difference. First operand has 127 places, 92 transitions, 210 flow. Second operand 24 states and 1910 transitions. [2023-11-10 11:47:52,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 190 transitions, 730 flow [2023-11-10 11:47:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 190 transitions, 666 flow, removed 26 selfloop flow, removed 8 redundant places. [2023-11-10 11:47:52,508 INFO L231 Difference]: Finished difference. Result has 142 places, 104 transitions, 346 flow [2023-11-10 11:47:52,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=346, PETRI_PLACES=142, PETRI_TRANSITIONS=104} [2023-11-10 11:47:52,510 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2023-11-10 11:47:52,510 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 104 transitions, 346 flow [2023-11-10 11:47:52,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 75.92307692307692) internal successors, (987), 13 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:52,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:52,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:52,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:47:52,512 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:52,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1418827407, now seen corresponding path program 1 times [2023-11-10 11:47:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:52,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143705014] [2023-11-10 11:47:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:53,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143705014] [2023-11-10 11:47:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143705014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:47:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904552693] [2023-11-10 11:47:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:53,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:47:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:47:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:47:53,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 112 [2023-11-10 11:47:53,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 104 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:53,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:53,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 112 [2023-11-10 11:47:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:54,555 INFO L124 PetriNetUnfolderBase]: 843/1773 cut-off events. [2023-11-10 11:47:54,555 INFO L125 PetriNetUnfolderBase]: For 5013/6759 co-relation queries the response was YES. [2023-11-10 11:47:54,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5861 conditions, 1773 events. 843/1773 cut-off events. For 5013/6759 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10350 event pairs, 157 based on Foata normal form. 33/1700 useless extension candidates. Maximal degree in co-relation 5776. Up to 546 conditions per place. [2023-11-10 11:47:54,572 INFO L140 encePairwiseOnDemand]: 96/112 looper letters, 46 selfloop transitions, 26 changer transitions 62/195 dead transitions. [2023-11-10 11:47:54,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 195 transitions, 1228 flow [2023-11-10 11:47:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:47:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:47:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1384 transitions. [2023-11-10 11:47:54,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.726890756302521 [2023-11-10 11:47:54,576 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1384 transitions. [2023-11-10 11:47:54,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1384 transitions. [2023-11-10 11:47:54,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:54,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1384 transitions. [2023-11-10 11:47:54,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 81.41176470588235) internal successors, (1384), 17 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:54,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:54,586 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:54,586 INFO L175 Difference]: Start difference. First operand has 142 places, 104 transitions, 346 flow. Second operand 17 states and 1384 transitions. [2023-11-10 11:47:54,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 195 transitions, 1228 flow [2023-11-10 11:47:54,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 195 transitions, 1110 flow, removed 56 selfloop flow, removed 15 redundant places. [2023-11-10 11:47:54,602 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 583 flow [2023-11-10 11:47:54,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=583, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2023-11-10 11:47:54,604 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2023-11-10 11:47:54,604 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 583 flow [2023-11-10 11:47:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:54,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:54,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:54,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:47:54,605 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:54,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash 642421509, now seen corresponding path program 2 times [2023-11-10 11:47:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124873309] [2023-11-10 11:47:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124873309] [2023-11-10 11:47:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124873309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:47:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294232288] [2023-11-10 11:47:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:55,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:47:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:47:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:47:55,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 112 [2023-11-10 11:47:55,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 583 flow. Second operand has 8 states, 8 states have (on average 77.125) internal successors, (617), 8 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:55,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:55,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 112 [2023-11-10 11:47:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:56,006 INFO L124 PetriNetUnfolderBase]: 776/1625 cut-off events. [2023-11-10 11:47:56,006 INFO L125 PetriNetUnfolderBase]: For 18856/26387 co-relation queries the response was YES. [2023-11-10 11:47:56,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8849 conditions, 1625 events. 776/1625 cut-off events. For 18856/26387 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9531 event pairs, 111 based on Foata normal form. 28/1539 useless extension candidates. Maximal degree in co-relation 8759. Up to 639 conditions per place. [2023-11-10 11:47:56,024 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 41 selfloop transitions, 5 changer transitions 62/169 dead transitions. [2023-11-10 11:47:56,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 169 transitions, 1472 flow [2023-11-10 11:47:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:47:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:47:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-11-10 11:47:56,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7297077922077922 [2023-11-10 11:47:56,028 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-11-10 11:47:56,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-11-10 11:47:56,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:56,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-11-10 11:47:56,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:56,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:56,041 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:56,041 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 583 flow. Second operand 11 states and 899 transitions. [2023-11-10 11:47:56,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 169 transitions, 1472 flow [2023-11-10 11:47:56,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 169 transitions, 1403 flow, removed 28 selfloop flow, removed 7 redundant places. [2023-11-10 11:47:56,078 INFO L231 Difference]: Finished difference. Result has 142 places, 95 transitions, 380 flow [2023-11-10 11:47:56,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=380, PETRI_PLACES=142, PETRI_TRANSITIONS=95} [2023-11-10 11:47:56,080 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2023-11-10 11:47:56,080 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 95 transitions, 380 flow [2023-11-10 11:47:56,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.125) internal successors, (617), 8 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:56,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:56,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:56,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:47:56,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:56,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1256610032, now seen corresponding path program 1 times [2023-11-10 11:47:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793861655] [2023-11-10 11:47:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:57,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:57,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793861655] [2023-11-10 11:47:57,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793861655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:57,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:47:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915682643] [2023-11-10 11:47:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:57,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:47:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:47:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:47:57,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 112 [2023-11-10 11:47:57,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 95 transitions, 380 flow. Second operand has 16 states, 16 states have (on average 75.6875) internal successors, (1211), 16 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:57,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:57,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 112 [2023-11-10 11:47:57,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:58,336 INFO L124 PetriNetUnfolderBase]: 485/1195 cut-off events. [2023-11-10 11:47:58,336 INFO L125 PetriNetUnfolderBase]: For 12402/15036 co-relation queries the response was YES. [2023-11-10 11:47:58,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 1195 events. 485/1195 cut-off events. For 12402/15036 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6832 event pairs, 91 based on Foata normal form. 14/1129 useless extension candidates. Maximal degree in co-relation 6236. Up to 523 conditions per place. [2023-11-10 11:47:58,351 INFO L140 encePairwiseOnDemand]: 97/112 looper letters, 46 selfloop transitions, 20 changer transitions 29/156 dead transitions. [2023-11-10 11:47:58,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 1428 flow [2023-11-10 11:47:58,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:47:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:47:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1354 transitions. [2023-11-10 11:47:58,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111344537815126 [2023-11-10 11:47:58,356 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1354 transitions. [2023-11-10 11:47:58,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1354 transitions. [2023-11-10 11:47:58,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:58,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1354 transitions. [2023-11-10 11:47:58,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 79.6470588235294) internal successors, (1354), 17 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:58,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:58,363 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:58,364 INFO L175 Difference]: Start difference. First operand has 142 places, 95 transitions, 380 flow. Second operand 17 states and 1354 transitions. [2023-11-10 11:47:58,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 1428 flow [2023-11-10 11:47:58,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 156 transitions, 932 flow, removed 236 selfloop flow, removed 22 redundant places. [2023-11-10 11:47:58,379 INFO L231 Difference]: Finished difference. Result has 138 places, 106 transitions, 466 flow [2023-11-10 11:47:58,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=466, PETRI_PLACES=138, PETRI_TRANSITIONS=106} [2023-11-10 11:47:58,380 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 21 predicate places. [2023-11-10 11:47:58,380 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 106 transitions, 466 flow [2023-11-10 11:47:58,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 75.6875) internal successors, (1211), 16 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:58,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:58,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:58,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:47:58,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:58,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2059627314, now seen corresponding path program 2 times [2023-11-10 11:47:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833906058] [2023-11-10 11:47:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:47:59,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:59,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833906058] [2023-11-10 11:47:59,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833906058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:59,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:59,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-10 11:47:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995876254] [2023-11-10 11:47:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:59,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-10 11:47:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-10 11:47:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-10 11:47:59,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 112 [2023-11-10 11:47:59,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 106 transitions, 466 flow. Second operand has 14 states, 14 states have (on average 78.71428571428571) internal successors, (1102), 14 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:59,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:59,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 112 [2023-11-10 11:47:59,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:00,452 INFO L124 PetriNetUnfolderBase]: 728/1743 cut-off events. [2023-11-10 11:48:00,452 INFO L125 PetriNetUnfolderBase]: For 8400/13024 co-relation queries the response was YES. [2023-11-10 11:48:00,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 1743 events. 728/1743 cut-off events. For 8400/13024 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11104 event pairs, 147 based on Foata normal form. 39/1692 useless extension candidates. Maximal degree in co-relation 7517. Up to 810 conditions per place. [2023-11-10 11:48:00,470 INFO L140 encePairwiseOnDemand]: 95/112 looper letters, 63 selfloop transitions, 29 changer transitions 48/204 dead transitions. [2023-11-10 11:48:00,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 204 transitions, 1593 flow [2023-11-10 11:48:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-10 11:48:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-10 11:48:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1902 transitions. [2023-11-10 11:48:00,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7383540372670807 [2023-11-10 11:48:00,475 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1902 transitions. [2023-11-10 11:48:00,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1902 transitions. [2023-11-10 11:48:00,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:00,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1902 transitions. [2023-11-10 11:48:00,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 82.69565217391305) internal successors, (1902), 23 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:00,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 112.0) internal successors, (2688), 24 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:00,485 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 112.0) internal successors, (2688), 24 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:00,485 INFO L175 Difference]: Start difference. First operand has 138 places, 106 transitions, 466 flow. Second operand 23 states and 1902 transitions. [2023-11-10 11:48:00,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 204 transitions, 1593 flow [2023-11-10 11:48:00,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 204 transitions, 1526 flow, removed 30 selfloop flow, removed 10 redundant places. [2023-11-10 11:48:00,499 INFO L231 Difference]: Finished difference. Result has 160 places, 130 transitions, 821 flow [2023-11-10 11:48:00,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=821, PETRI_PLACES=160, PETRI_TRANSITIONS=130} [2023-11-10 11:48:00,500 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2023-11-10 11:48:00,500 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 130 transitions, 821 flow [2023-11-10 11:48:00,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.71428571428571) internal successors, (1102), 14 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:00,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:00,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:00,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:48:00,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:00,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash -365858714, now seen corresponding path program 3 times [2023-11-10 11:48:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447873012] [2023-11-10 11:48:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447873012] [2023-11-10 11:48:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447873012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:48:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213315006] [2023-11-10 11:48:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:01,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:48:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:01,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:48:01,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:48:01,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 112 [2023-11-10 11:48:01,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 130 transitions, 821 flow. Second operand has 13 states, 13 states have (on average 79.76923076923077) internal successors, (1037), 13 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:01,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:01,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 112 [2023-11-10 11:48:01,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:02,127 INFO L124 PetriNetUnfolderBase]: 585/1527 cut-off events. [2023-11-10 11:48:02,127 INFO L125 PetriNetUnfolderBase]: For 11940/16294 co-relation queries the response was YES. [2023-11-10 11:48:02,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7866 conditions, 1527 events. 585/1527 cut-off events. For 11940/16294 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10119 event pairs, 102 based on Foata normal form. 43/1480 useless extension candidates. Maximal degree in co-relation 7769. Up to 788 conditions per place. [2023-11-10 11:48:02,146 INFO L140 encePairwiseOnDemand]: 99/112 looper letters, 63 selfloop transitions, 31 changer transitions 28/187 dead transitions. [2023-11-10 11:48:02,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 187 transitions, 1723 flow [2023-11-10 11:48:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:48:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:48:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1253 transitions. [2023-11-10 11:48:02,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2023-11-10 11:48:02,149 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1253 transitions. [2023-11-10 11:48:02,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1253 transitions. [2023-11-10 11:48:02,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:02,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1253 transitions. [2023-11-10 11:48:02,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,156 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,156 INFO L175 Difference]: Start difference. First operand has 160 places, 130 transitions, 821 flow. Second operand 15 states and 1253 transitions. [2023-11-10 11:48:02,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 187 transitions, 1723 flow [2023-11-10 11:48:02,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 187 transitions, 1615 flow, removed 50 selfloop flow, removed 10 redundant places. [2023-11-10 11:48:02,178 INFO L231 Difference]: Finished difference. Result has 163 places, 144 transitions, 1072 flow [2023-11-10 11:48:02,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1072, PETRI_PLACES=163, PETRI_TRANSITIONS=144} [2023-11-10 11:48:02,180 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2023-11-10 11:48:02,181 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 144 transitions, 1072 flow [2023-11-10 11:48:02,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 79.76923076923077) internal successors, (1037), 13 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:02,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:02,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:48:02,182 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:02,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1558073894, now seen corresponding path program 1 times [2023-11-10 11:48:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:02,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911412556] [2023-11-10 11:48:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911412556] [2023-11-10 11:48:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911412556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:02,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458284946] [2023-11-10 11:48:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:02,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:02,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2023-11-10 11:48:02,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:02,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:02,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2023-11-10 11:48:02,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:03,942 INFO L124 PetriNetUnfolderBase]: 4853/8624 cut-off events. [2023-11-10 11:48:03,942 INFO L125 PetriNetUnfolderBase]: For 65403/66794 co-relation queries the response was YES. [2023-11-10 11:48:03,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36892 conditions, 8624 events. 4853/8624 cut-off events. For 65403/66794 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 63400 event pairs, 168 based on Foata normal form. 141/8599 useless extension candidates. Maximal degree in co-relation 36800. Up to 3146 conditions per place. [2023-11-10 11:48:03,995 INFO L140 encePairwiseOnDemand]: 102/112 looper letters, 104 selfloop transitions, 6 changer transitions 147/326 dead transitions. [2023-11-10 11:48:03,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 326 transitions, 3787 flow [2023-11-10 11:48:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:48:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:48:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 938 transitions. [2023-11-10 11:48:03,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8375 [2023-11-10 11:48:03,997 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 938 transitions. [2023-11-10 11:48:04,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 938 transitions. [2023-11-10 11:48:04,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:04,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 938 transitions. [2023-11-10 11:48:04,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.8) internal successors, (938), 10 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,005 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,006 INFO L175 Difference]: Start difference. First operand has 163 places, 144 transitions, 1072 flow. Second operand 10 states and 938 transitions. [2023-11-10 11:48:04,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 326 transitions, 3787 flow [2023-11-10 11:48:04,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 326 transitions, 3428 flow, removed 90 selfloop flow, removed 16 redundant places. [2023-11-10 11:48:04,076 INFO L231 Difference]: Finished difference. Result has 155 places, 130 transitions, 794 flow [2023-11-10 11:48:04,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=794, PETRI_PLACES=155, PETRI_TRANSITIONS=130} [2023-11-10 11:48:04,077 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2023-11-10 11:48:04,077 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 130 transitions, 794 flow [2023-11-10 11:48:04,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:04,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:04,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:48:04,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:04,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash -341669843, now seen corresponding path program 1 times [2023-11-10 11:48:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020583349] [2023-11-10 11:48:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020583349] [2023-11-10 11:48:04,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020583349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:04,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:04,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:48:04,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956673211] [2023-11-10 11:48:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:04,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:48:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:04,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:48:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:48:04,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2023-11-10 11:48:04,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 130 transitions, 794 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:04,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:04,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2023-11-10 11:48:04,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:05,212 INFO L124 PetriNetUnfolderBase]: 1517/3333 cut-off events. [2023-11-10 11:48:05,212 INFO L125 PetriNetUnfolderBase]: For 18832/19137 co-relation queries the response was YES. [2023-11-10 11:48:05,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 3333 events. 1517/3333 cut-off events. For 18832/19137 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 24226 event pairs, 56 based on Foata normal form. 145/3457 useless extension candidates. Maximal degree in co-relation 14903. Up to 976 conditions per place. [2023-11-10 11:48:05,230 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 102 selfloop transitions, 9 changer transitions 95/275 dead transitions. [2023-11-10 11:48:05,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 275 transitions, 2892 flow [2023-11-10 11:48:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:48:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:48:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 932 transitions. [2023-11-10 11:48:05,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2023-11-10 11:48:05,233 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 932 transitions. [2023-11-10 11:48:05,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 932 transitions. [2023-11-10 11:48:05,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:05,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 932 transitions. [2023-11-10 11:48:05,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,237 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,237 INFO L175 Difference]: Start difference. First operand has 155 places, 130 transitions, 794 flow. Second operand 10 states and 932 transitions. [2023-11-10 11:48:05,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 275 transitions, 2892 flow [2023-11-10 11:48:05,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 275 transitions, 2814 flow, removed 15 selfloop flow, removed 11 redundant places. [2023-11-10 11:48:05,261 INFO L231 Difference]: Finished difference. Result has 152 places, 124 transitions, 744 flow [2023-11-10 11:48:05,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=744, PETRI_PLACES=152, PETRI_TRANSITIONS=124} [2023-11-10 11:48:05,262 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 35 predicate places. [2023-11-10 11:48:05,262 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 124 transitions, 744 flow [2023-11-10 11:48:05,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:05,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:48:05,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:05,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -94916752, now seen corresponding path program 1 times [2023-11-10 11:48:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078690599] [2023-11-10 11:48:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078690599] [2023-11-10 11:48:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078690599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:48:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064558207] [2023-11-10 11:48:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:05,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:48:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:48:05,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:48:05,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2023-11-10 11:48:05,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 124 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 85.625) internal successors, (685), 8 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:05,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2023-11-10 11:48:05,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:05,879 INFO L124 PetriNetUnfolderBase]: 481/1381 cut-off events. [2023-11-10 11:48:05,879 INFO L125 PetriNetUnfolderBase]: For 7542/7845 co-relation queries the response was YES. [2023-11-10 11:48:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6134 conditions, 1381 events. 481/1381 cut-off events. For 7542/7845 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9565 event pairs, 56 based on Foata normal form. 49/1409 useless extension candidates. Maximal degree in co-relation 6049. Up to 364 conditions per place. [2023-11-10 11:48:05,891 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 78 selfloop transitions, 12 changer transitions 45/204 dead transitions. [2023-11-10 11:48:05,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 204 transitions, 1940 flow [2023-11-10 11:48:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:48:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:48:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 986 transitions. [2023-11-10 11:48:05,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8003246753246753 [2023-11-10 11:48:05,894 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 986 transitions. [2023-11-10 11:48:05,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 986 transitions. [2023-11-10 11:48:05,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:05,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 986 transitions. [2023-11-10 11:48:05,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,898 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,898 INFO L175 Difference]: Start difference. First operand has 152 places, 124 transitions, 744 flow. Second operand 11 states and 986 transitions. [2023-11-10 11:48:05,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 204 transitions, 1940 flow [2023-11-10 11:48:05,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 204 transitions, 1751 flow, removed 72 selfloop flow, removed 16 redundant places. [2023-11-10 11:48:05,921 INFO L231 Difference]: Finished difference. Result has 148 places, 120 transitions, 640 flow [2023-11-10 11:48:05,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=640, PETRI_PLACES=148, PETRI_TRANSITIONS=120} [2023-11-10 11:48:05,922 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 31 predicate places. [2023-11-10 11:48:05,922 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 120 transitions, 640 flow [2023-11-10 11:48:05,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.625) internal successors, (685), 8 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:05,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:05,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:05,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:48:05,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:05,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash 523912461, now seen corresponding path program 1 times [2023-11-10 11:48:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034259336] [2023-11-10 11:48:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034259336] [2023-11-10 11:48:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034259336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-10 11:48:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166358033] [2023-11-10 11:48:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:06,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-10 11:48:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:06,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-10 11:48:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-10 11:48:06,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 112 [2023-11-10 11:48:06,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 120 transitions, 640 flow. Second operand has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:06,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:06,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 112 [2023-11-10 11:48:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:07,539 INFO L124 PetriNetUnfolderBase]: 274/1185 cut-off events. [2023-11-10 11:48:07,539 INFO L125 PetriNetUnfolderBase]: For 3043/3091 co-relation queries the response was YES. [2023-11-10 11:48:07,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1185 events. 274/1185 cut-off events. For 3043/3091 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9327 event pairs, 22 based on Foata normal form. 2/1160 useless extension candidates. Maximal degree in co-relation 4067. Up to 257 conditions per place. [2023-11-10 11:48:07,551 INFO L140 encePairwiseOnDemand]: 96/112 looper letters, 58 selfloop transitions, 24 changer transitions 29/176 dead transitions. [2023-11-10 11:48:07,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 176 transitions, 1325 flow [2023-11-10 11:48:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:48:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:48:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1100 transitions. [2023-11-10 11:48:07,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.701530612244898 [2023-11-10 11:48:07,553 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1100 transitions. [2023-11-10 11:48:07,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1100 transitions. [2023-11-10 11:48:07,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:07,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1100 transitions. [2023-11-10 11:48:07,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 78.57142857142857) internal successors, (1100), 14 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,558 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,558 INFO L175 Difference]: Start difference. First operand has 148 places, 120 transitions, 640 flow. Second operand 14 states and 1100 transitions. [2023-11-10 11:48:07,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 176 transitions, 1325 flow [2023-11-10 11:48:07,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 176 transitions, 1035 flow, removed 126 selfloop flow, removed 19 redundant places. [2023-11-10 11:48:07,575 INFO L231 Difference]: Finished difference. Result has 146 places, 134 transitions, 692 flow [2023-11-10 11:48:07,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=692, PETRI_PLACES=146, PETRI_TRANSITIONS=134} [2023-11-10 11:48:07,575 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2023-11-10 11:48:07,576 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 134 transitions, 692 flow [2023-11-10 11:48:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.9090909090909) internal successors, (835), 11 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:07,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:07,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:48:07,577 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:07,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1686370043, now seen corresponding path program 2 times [2023-11-10 11:48:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478418677] [2023-11-10 11:48:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:08,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:08,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478418677] [2023-11-10 11:48:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478418677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:08,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:48:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870668714] [2023-11-10 11:48:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:08,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:48:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:48:08,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:48:08,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2023-11-10 11:48:08,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 134 transitions, 692 flow. Second operand has 13 states, 13 states have (on average 82.84615384615384) internal successors, (1077), 13 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:08,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:08,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2023-11-10 11:48:08,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:09,164 INFO L124 PetriNetUnfolderBase]: 192/881 cut-off events. [2023-11-10 11:48:09,164 INFO L125 PetriNetUnfolderBase]: For 1444/1625 co-relation queries the response was YES. [2023-11-10 11:48:09,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 881 events. 192/881 cut-off events. For 1444/1625 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6351 event pairs, 20 based on Foata normal form. 15/873 useless extension candidates. Maximal degree in co-relation 2555. Up to 214 conditions per place. [2023-11-10 11:48:09,170 INFO L140 encePairwiseOnDemand]: 97/112 looper letters, 48 selfloop transitions, 19 changer transitions 20/160 dead transitions. [2023-11-10 11:48:09,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 160 transitions, 1058 flow [2023-11-10 11:48:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1111 transitions. [2023-11-10 11:48:09,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7630494505494505 [2023-11-10 11:48:09,173 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1111 transitions. [2023-11-10 11:48:09,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1111 transitions. [2023-11-10 11:48:09,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:09,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1111 transitions. [2023-11-10 11:48:09,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 85.46153846153847) internal successors, (1111), 13 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,178 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,178 INFO L175 Difference]: Start difference. First operand has 146 places, 134 transitions, 692 flow. Second operand 13 states and 1111 transitions. [2023-11-10 11:48:09,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 160 transitions, 1058 flow [2023-11-10 11:48:09,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 160 transitions, 959 flow, removed 36 selfloop flow, removed 10 redundant places. [2023-11-10 11:48:09,185 INFO L231 Difference]: Finished difference. Result has 148 places, 134 transitions, 689 flow [2023-11-10 11:48:09,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=689, PETRI_PLACES=148, PETRI_TRANSITIONS=134} [2023-11-10 11:48:09,187 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 31 predicate places. [2023-11-10 11:48:09,187 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 134 transitions, 689 flow [2023-11-10 11:48:09,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 82.84615384615384) internal successors, (1077), 13 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:09,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:09,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:09,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:48:09,188 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:09,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2051379261, now seen corresponding path program 3 times [2023-11-10 11:48:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431696612] [2023-11-10 11:48:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:10,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431696612] [2023-11-10 11:48:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431696612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:48:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698393954] [2023-11-10 11:48:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:48:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:48:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:48:10,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2023-11-10 11:48:10,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 134 transitions, 689 flow. Second operand has 12 states, 12 states have (on average 81.16666666666667) internal successors, (974), 12 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:10,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:10,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2023-11-10 11:48:10,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:11,033 INFO L124 PetriNetUnfolderBase]: 176/852 cut-off events. [2023-11-10 11:48:11,034 INFO L125 PetriNetUnfolderBase]: For 1276/1459 co-relation queries the response was YES. [2023-11-10 11:48:11,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 852 events. 176/852 cut-off events. For 1276/1459 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6169 event pairs, 10 based on Foata normal form. 7/832 useless extension candidates. Maximal degree in co-relation 2371. Up to 232 conditions per place. [2023-11-10 11:48:11,039 INFO L140 encePairwiseOnDemand]: 99/112 looper letters, 49 selfloop transitions, 21 changer transitions 7/148 dead transitions. [2023-11-10 11:48:11,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 945 flow [2023-11-10 11:48:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:48:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:48:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 832 transitions. [2023-11-10 11:48:11,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2023-11-10 11:48:11,041 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 832 transitions. [2023-11-10 11:48:11,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 832 transitions. [2023-11-10 11:48:11,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:11,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 832 transitions. [2023-11-10 11:48:11,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,045 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,045 INFO L175 Difference]: Start difference. First operand has 148 places, 134 transitions, 689 flow. Second operand 10 states and 832 transitions. [2023-11-10 11:48:11,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 945 flow [2023-11-10 11:48:11,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 148 transitions, 893 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-11-10 11:48:11,051 INFO L231 Difference]: Finished difference. Result has 147 places, 138 transitions, 766 flow [2023-11-10 11:48:11,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=766, PETRI_PLACES=147, PETRI_TRANSITIONS=138} [2023-11-10 11:48:11,052 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 30 predicate places. [2023-11-10 11:48:11,052 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 138 transitions, 766 flow [2023-11-10 11:48:11,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.16666666666667) internal successors, (974), 12 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:11,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:11,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:11,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-10 11:48:11,053 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:11,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1256931119, now seen corresponding path program 4 times [2023-11-10 11:48:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943425331] [2023-11-10 11:48:11,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943425331] [2023-11-10 11:48:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943425331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-10 11:48:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493546352] [2023-11-10 11:48:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:12,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-10 11:48:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:12,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-10 11:48:12,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-11-10 11:48:12,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 112 [2023-11-10 11:48:12,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 138 transitions, 766 flow. Second operand has 17 states, 17 states have (on average 73.94117647058823) internal successors, (1257), 17 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:12,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:12,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 112 [2023-11-10 11:48:12,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:13,461 INFO L124 PetriNetUnfolderBase]: 216/983 cut-off events. [2023-11-10 11:48:13,461 INFO L125 PetriNetUnfolderBase]: For 1759/1759 co-relation queries the response was YES. [2023-11-10 11:48:13,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 983 events. 216/983 cut-off events. For 1759/1759 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7402 event pairs, 20 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 2842. Up to 209 conditions per place. [2023-11-10 11:48:13,468 INFO L140 encePairwiseOnDemand]: 96/112 looper letters, 53 selfloop transitions, 25 changer transitions 20/162 dead transitions. [2023-11-10 11:48:13,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 1140 flow [2023-11-10 11:48:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:48:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:48:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1221 transitions. [2023-11-10 11:48:13,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6813616071428571 [2023-11-10 11:48:13,471 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1221 transitions. [2023-11-10 11:48:13,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1221 transitions. [2023-11-10 11:48:13,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:13,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1221 transitions. [2023-11-10 11:48:13,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 76.3125) internal successors, (1221), 16 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:13,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:13,476 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:13,476 INFO L175 Difference]: Start difference. First operand has 147 places, 138 transitions, 766 flow. Second operand 16 states and 1221 transitions. [2023-11-10 11:48:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 162 transitions, 1140 flow [2023-11-10 11:48:13,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 1063 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-11-10 11:48:13,484 INFO L231 Difference]: Finished difference. Result has 155 places, 133 transitions, 716 flow [2023-11-10 11:48:13,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=716, PETRI_PLACES=155, PETRI_TRANSITIONS=133} [2023-11-10 11:48:13,484 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2023-11-10 11:48:13,485 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 133 transitions, 716 flow [2023-11-10 11:48:13,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 73.94117647058823) internal successors, (1257), 17 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:13,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:13,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:13,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-10 11:48:13,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:13,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash -536677821, now seen corresponding path program 5 times [2023-11-10 11:48:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196163400] [2023-11-10 11:48:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:14,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196163400] [2023-11-10 11:48:14,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196163400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:14,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:48:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105538636] [2023-11-10 11:48:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:14,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:48:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:48:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:48:14,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 112 [2023-11-10 11:48:14,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 133 transitions, 716 flow. Second operand has 15 states, 15 states have (on average 78.86666666666666) internal successors, (1183), 15 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:14,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:14,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 112 [2023-11-10 11:48:14,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:14,975 INFO L124 PetriNetUnfolderBase]: 162/826 cut-off events. [2023-11-10 11:48:14,976 INFO L125 PetriNetUnfolderBase]: For 1447/1489 co-relation queries the response was YES. [2023-11-10 11:48:14,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 826 events. 162/826 cut-off events. For 1447/1489 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5914 event pairs, 27 based on Foata normal form. 11/814 useless extension candidates. Maximal degree in co-relation 2297. Up to 213 conditions per place. [2023-11-10 11:48:14,982 INFO L140 encePairwiseOnDemand]: 95/112 looper letters, 55 selfloop transitions, 14 changer transitions 16/154 dead transitions. [2023-11-10 11:48:14,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 154 transitions, 1023 flow [2023-11-10 11:48:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:48:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:48:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1212 transitions. [2023-11-10 11:48:14,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2023-11-10 11:48:14,984 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1212 transitions. [2023-11-10 11:48:14,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1212 transitions. [2023-11-10 11:48:14,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:14,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1212 transitions. [2023-11-10 11:48:14,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 80.8) internal successors, (1212), 15 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:14,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:14,990 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:14,991 INFO L175 Difference]: Start difference. First operand has 155 places, 133 transitions, 716 flow. Second operand 15 states and 1212 transitions. [2023-11-10 11:48:14,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 154 transitions, 1023 flow [2023-11-10 11:48:14,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 952 flow, removed 7 selfloop flow, removed 15 redundant places. [2023-11-10 11:48:15,000 INFO L231 Difference]: Finished difference. Result has 156 places, 133 transitions, 704 flow [2023-11-10 11:48:15,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=704, PETRI_PLACES=156, PETRI_TRANSITIONS=133} [2023-11-10 11:48:15,001 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2023-11-10 11:48:15,002 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 133 transitions, 704 flow [2023-11-10 11:48:15,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 78.86666666666666) internal successors, (1183), 15 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:15,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:15,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:15,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-10 11:48:15,002 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:15,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -676418435, now seen corresponding path program 6 times [2023-11-10 11:48:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740324905] [2023-11-10 11:48:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740324905] [2023-11-10 11:48:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740324905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:48:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029061165] [2023-11-10 11:48:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:15,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:48:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:48:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:48:15,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 112 [2023-11-10 11:48:15,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 133 transitions, 704 flow. Second operand has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:15,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:15,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 112 [2023-11-10 11:48:15,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:15,686 INFO L124 PetriNetUnfolderBase]: 162/853 cut-off events. [2023-11-10 11:48:15,686 INFO L125 PetriNetUnfolderBase]: For 1434/1497 co-relation queries the response was YES. [2023-11-10 11:48:15,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 853 events. 162/853 cut-off events. For 1434/1497 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6254 event pairs, 20 based on Foata normal form. 19/845 useless extension candidates. Maximal degree in co-relation 2349. Up to 221 conditions per place. [2023-11-10 11:48:15,690 INFO L140 encePairwiseOnDemand]: 100/112 looper letters, 50 selfloop transitions, 11 changer transitions 17/152 dead transitions. [2023-11-10 11:48:15,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 997 flow [2023-11-10 11:48:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:48:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:48:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2023-11-10 11:48:15,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-10 11:48:15,691 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2023-11-10 11:48:15,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2023-11-10 11:48:15,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:15,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2023-11-10 11:48:15,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:15,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:15,694 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:15,694 INFO L175 Difference]: Start difference. First operand has 156 places, 133 transitions, 704 flow. Second operand 9 states and 784 transitions. [2023-11-10 11:48:15,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 152 transitions, 997 flow [2023-11-10 11:48:15,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 152 transitions, 930 flow, removed 20 selfloop flow, removed 14 redundant places. [2023-11-10 11:48:15,701 INFO L231 Difference]: Finished difference. Result has 152 places, 133 transitions, 713 flow [2023-11-10 11:48:15,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=713, PETRI_PLACES=152, PETRI_TRANSITIONS=133} [2023-11-10 11:48:15,702 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 35 predicate places. [2023-11-10 11:48:15,702 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 133 transitions, 713 flow [2023-11-10 11:48:15,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:15,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:15,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:15,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-10 11:48:15,703 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:15,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1155918225, now seen corresponding path program 7 times [2023-11-10 11:48:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022041968] [2023-11-10 11:48:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022041968] [2023-11-10 11:48:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022041968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:16,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:16,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:48:16,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762965169] [2023-11-10 11:48:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:16,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:48:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:48:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:48:16,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 112 [2023-11-10 11:48:16,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 133 transitions, 713 flow. Second operand has 12 states, 12 states have (on average 76.58333333333333) internal successors, (919), 12 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:16,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:16,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 112 [2023-11-10 11:48:16,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:17,194 INFO L124 PetriNetUnfolderBase]: 218/1092 cut-off events. [2023-11-10 11:48:17,195 INFO L125 PetriNetUnfolderBase]: For 1745/1745 co-relation queries the response was YES. [2023-11-10 11:48:17,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2958 conditions, 1092 events. 218/1092 cut-off events. For 1745/1745 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8773 event pairs, 8 based on Foata normal form. 2/1077 useless extension candidates. Maximal degree in co-relation 2926. Up to 134 conditions per place. [2023-11-10 11:48:17,202 INFO L140 encePairwiseOnDemand]: 98/112 looper letters, 65 selfloop transitions, 36 changer transitions 23/190 dead transitions. [2023-11-10 11:48:17,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 190 transitions, 1414 flow [2023-11-10 11:48:17,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:48:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:48:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1346 transitions. [2023-11-10 11:48:17,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7069327731092437 [2023-11-10 11:48:17,204 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1346 transitions. [2023-11-10 11:48:17,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1346 transitions. [2023-11-10 11:48:17,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:17,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1346 transitions. [2023-11-10 11:48:17,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 79.17647058823529) internal successors, (1346), 17 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:17,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:17,209 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:17,209 INFO L175 Difference]: Start difference. First operand has 152 places, 133 transitions, 713 flow. Second operand 17 states and 1346 transitions. [2023-11-10 11:48:17,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 190 transitions, 1414 flow [2023-11-10 11:48:17,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 190 transitions, 1382 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-10 11:48:17,218 INFO L231 Difference]: Finished difference. Result has 163 places, 140 transitions, 896 flow [2023-11-10 11:48:17,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=896, PETRI_PLACES=163, PETRI_TRANSITIONS=140} [2023-11-10 11:48:17,218 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2023-11-10 11:48:17,218 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 140 transitions, 896 flow [2023-11-10 11:48:17,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.58333333333333) internal successors, (919), 12 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:17,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:17,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:17,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-10 11:48:17,219 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:17,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1173800019, now seen corresponding path program 8 times [2023-11-10 11:48:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188800039] [2023-11-10 11:48:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188800039] [2023-11-10 11:48:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188800039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:48:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753623150] [2023-11-10 11:48:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:18,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:48:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:18,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:48:18,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:48:18,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 112 [2023-11-10 11:48:18,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 140 transitions, 896 flow. Second operand has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:18,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:18,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 112 [2023-11-10 11:48:18,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:18,695 INFO L124 PetriNetUnfolderBase]: 133/706 cut-off events. [2023-11-10 11:48:18,695 INFO L125 PetriNetUnfolderBase]: For 1645/1689 co-relation queries the response was YES. [2023-11-10 11:48:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 706 events. 133/706 cut-off events. For 1645/1689 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4903 event pairs, 23 based on Foata normal form. 4/690 useless extension candidates. Maximal degree in co-relation 2181. Up to 158 conditions per place. [2023-11-10 11:48:18,701 INFO L140 encePairwiseOnDemand]: 99/112 looper letters, 56 selfloop transitions, 5 changer transitions 29/158 dead transitions. [2023-11-10 11:48:18,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 158 transitions, 1229 flow [2023-11-10 11:48:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:48:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:48:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1117 transitions. [2023-11-10 11:48:18,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7123724489795918 [2023-11-10 11:48:18,704 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1117 transitions. [2023-11-10 11:48:18,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1117 transitions. [2023-11-10 11:48:18,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:18,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1117 transitions. [2023-11-10 11:48:18,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 79.78571428571429) internal successors, (1117), 14 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:18,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:18,708 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:18,708 INFO L175 Difference]: Start difference. First operand has 163 places, 140 transitions, 896 flow. Second operand 14 states and 1117 transitions. [2023-11-10 11:48:18,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 158 transitions, 1229 flow [2023-11-10 11:48:18,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 158 transitions, 1105 flow, removed 36 selfloop flow, removed 11 redundant places. [2023-11-10 11:48:18,717 INFO L231 Difference]: Finished difference. Result has 167 places, 128 transitions, 695 flow [2023-11-10 11:48:18,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=695, PETRI_PLACES=167, PETRI_TRANSITIONS=128} [2023-11-10 11:48:18,718 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places. [2023-11-10 11:48:18,718 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 128 transitions, 695 flow [2023-11-10 11:48:18,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:18,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:18,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:18,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-10 11:48:18,719 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:18,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -93944735, now seen corresponding path program 9 times [2023-11-10 11:48:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:18,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413655917] [2023-11-10 11:48:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413655917] [2023-11-10 11:48:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413655917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:48:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671628269] [2023-11-10 11:48:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:20,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:48:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:48:20,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:48:20,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 112 [2023-11-10 11:48:20,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 128 transitions, 695 flow. Second operand has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:20,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:20,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 112 [2023-11-10 11:48:20,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:20,563 INFO L124 PetriNetUnfolderBase]: 124/712 cut-off events. [2023-11-10 11:48:20,563 INFO L125 PetriNetUnfolderBase]: For 1343/1365 co-relation queries the response was YES. [2023-11-10 11:48:20,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 712 events. 124/712 cut-off events. For 1343/1365 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5064 event pairs, 8 based on Foata normal form. 9/710 useless extension candidates. Maximal degree in co-relation 1968. Up to 90 conditions per place. [2023-11-10 11:48:20,567 INFO L140 encePairwiseOnDemand]: 97/112 looper letters, 54 selfloop transitions, 22 changer transitions 20/164 dead transitions. [2023-11-10 11:48:20,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 1207 flow [2023-11-10 11:48:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:48:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:48:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1206 transitions. [2023-11-10 11:48:20,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2023-11-10 11:48:20,569 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1206 transitions. [2023-11-10 11:48:20,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1206 transitions. [2023-11-10 11:48:20,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:20,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1206 transitions. [2023-11-10 11:48:20,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 80.4) internal successors, (1206), 15 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:20,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:20,573 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:20,574 INFO L175 Difference]: Start difference. First operand has 167 places, 128 transitions, 695 flow. Second operand 15 states and 1206 transitions. [2023-11-10 11:48:20,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 1207 flow [2023-11-10 11:48:20,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 1091 flow, removed 33 selfloop flow, removed 18 redundant places. [2023-11-10 11:48:20,581 INFO L231 Difference]: Finished difference. Result has 154 places, 124 transitions, 649 flow [2023-11-10 11:48:20,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=649, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2023-11-10 11:48:20,582 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2023-11-10 11:48:20,582 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 649 flow [2023-11-10 11:48:20,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:20,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:20,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:20,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-10 11:48:20,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:20,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1831265665, now seen corresponding path program 10 times [2023-11-10 11:48:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:20,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605333563] [2023-11-10 11:48:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:21,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605333563] [2023-11-10 11:48:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605333563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:48:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413141044] [2023-11-10 11:48:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:21,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:48:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:48:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:48:21,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 112 [2023-11-10 11:48:21,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 649 flow. Second operand has 10 states, 10 states have (on average 82.5) internal successors, (825), 10 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:21,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:21,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 112 [2023-11-10 11:48:21,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:21,323 INFO L124 PetriNetUnfolderBase]: 102/619 cut-off events. [2023-11-10 11:48:21,323 INFO L125 PetriNetUnfolderBase]: For 1045/1066 co-relation queries the response was YES. [2023-11-10 11:48:21,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 619 events. 102/619 cut-off events. For 1045/1066 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4151 event pairs, 15 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 1612. Up to 127 conditions per place. [2023-11-10 11:48:21,326 INFO L140 encePairwiseOnDemand]: 102/112 looper letters, 44 selfloop transitions, 6 changer transitions 16/138 dead transitions. [2023-11-10 11:48:21,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 138 transitions, 900 flow [2023-11-10 11:48:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:48:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:48:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 847 transitions. [2023-11-10 11:48:21,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75625 [2023-11-10 11:48:21,328 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 847 transitions. [2023-11-10 11:48:21,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 847 transitions. [2023-11-10 11:48:21,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:21,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 847 transitions. [2023-11-10 11:48:21,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.7) internal successors, (847), 10 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:21,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:21,335 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:21,335 INFO L175 Difference]: Start difference. First operand has 154 places, 124 transitions, 649 flow. Second operand 10 states and 847 transitions. [2023-11-10 11:48:21,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 138 transitions, 900 flow [2023-11-10 11:48:21,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 138 transitions, 850 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-11-10 11:48:21,342 INFO L231 Difference]: Finished difference. Result has 151 places, 120 transitions, 584 flow [2023-11-10 11:48:21,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=584, PETRI_PLACES=151, PETRI_TRANSITIONS=120} [2023-11-10 11:48:21,342 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2023-11-10 11:48:21,342 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 120 transitions, 584 flow [2023-11-10 11:48:21,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.5) internal successors, (825), 10 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:21,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:21,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:21,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-10 11:48:21,343 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:21,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash 4143987, now seen corresponding path program 11 times [2023-11-10 11:48:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:21,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830227996] [2023-11-10 11:48:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:22,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:22,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830227996] [2023-11-10 11:48:22,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830227996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:22,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:22,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:48:22,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035594525] [2023-11-10 11:48:22,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:22,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:48:22,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:22,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:48:22,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:48:22,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 112 [2023-11-10 11:48:22,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 120 transitions, 584 flow. Second operand has 13 states, 13 states have (on average 75.46153846153847) internal successors, (981), 13 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:22,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:22,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 112 [2023-11-10 11:48:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:22,628 INFO L124 PetriNetUnfolderBase]: 107/632 cut-off events. [2023-11-10 11:48:22,628 INFO L125 PetriNetUnfolderBase]: For 975/975 co-relation queries the response was YES. [2023-11-10 11:48:22,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 632 events. 107/632 cut-off events. For 975/975 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4315 event pairs, 3 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 1631. Up to 103 conditions per place. [2023-11-10 11:48:22,632 INFO L140 encePairwiseOnDemand]: 99/112 looper letters, 44 selfloop transitions, 13 changer transitions 22/144 dead transitions. [2023-11-10 11:48:22,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 144 transitions, 943 flow [2023-11-10 11:48:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1008 transitions. [2023-11-10 11:48:22,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2023-11-10 11:48:22,634 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1008 transitions. [2023-11-10 11:48:22,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1008 transitions. [2023-11-10 11:48:22,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:22,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1008 transitions. [2023-11-10 11:48:22,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 77.53846153846153) internal successors, (1008), 13 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:22,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:22,637 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:22,637 INFO L175 Difference]: Start difference. First operand has 151 places, 120 transitions, 584 flow. Second operand 13 states and 1008 transitions. [2023-11-10 11:48:22,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 144 transitions, 943 flow [2023-11-10 11:48:22,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 899 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-11-10 11:48:22,644 INFO L231 Difference]: Finished difference. Result has 153 places, 114 transitions, 524 flow [2023-11-10 11:48:22,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=524, PETRI_PLACES=153, PETRI_TRANSITIONS=114} [2023-11-10 11:48:22,644 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 36 predicate places. [2023-11-10 11:48:22,645 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 114 transitions, 524 flow [2023-11-10 11:48:22,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 75.46153846153847) internal successors, (981), 13 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:22,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:22,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:22,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-10 11:48:22,645 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:22,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1302837171, now seen corresponding path program 12 times [2023-11-10 11:48:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501464555] [2023-11-10 11:48:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:24,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501464555] [2023-11-10 11:48:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501464555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:48:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019986367] [2023-11-10 11:48:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:24,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:48:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:24,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:48:24,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:48:24,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 112 [2023-11-10 11:48:24,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 114 transitions, 524 flow. Second operand has 16 states, 16 states have (on average 76.875) internal successors, (1230), 16 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:24,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:24,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 112 [2023-11-10 11:48:24,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:24,776 INFO L124 PetriNetUnfolderBase]: 81/539 cut-off events. [2023-11-10 11:48:24,776 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2023-11-10 11:48:24,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 539 events. 81/539 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3464 event pairs, 7 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 1290. Up to 75 conditions per place. [2023-11-10 11:48:24,778 INFO L140 encePairwiseOnDemand]: 100/112 looper letters, 36 selfloop transitions, 12 changer transitions 15/130 dead transitions. [2023-11-10 11:48:24,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 130 transitions, 775 flow [2023-11-10 11:48:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1024 transitions. [2023-11-10 11:48:24,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7032967032967034 [2023-11-10 11:48:24,780 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1024 transitions. [2023-11-10 11:48:24,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1024 transitions. [2023-11-10 11:48:24,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:24,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1024 transitions. [2023-11-10 11:48:24,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.76923076923077) internal successors, (1024), 13 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:24,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:24,787 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:24,788 INFO L175 Difference]: Start difference. First operand has 153 places, 114 transitions, 524 flow. Second operand 13 states and 1024 transitions. [2023-11-10 11:48:24,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 130 transitions, 775 flow [2023-11-10 11:48:24,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 130 transitions, 720 flow, removed 12 selfloop flow, removed 15 redundant places. [2023-11-10 11:48:24,793 INFO L231 Difference]: Finished difference. Result has 145 places, 109 transitions, 455 flow [2023-11-10 11:48:24,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=455, PETRI_PLACES=145, PETRI_TRANSITIONS=109} [2023-11-10 11:48:24,794 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 28 predicate places. [2023-11-10 11:48:24,794 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 109 transitions, 455 flow [2023-11-10 11:48:24,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 76.875) internal successors, (1230), 16 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:24,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:24,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:24,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-10 11:48:24,795 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:24,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1353111143, now seen corresponding path program 13 times [2023-11-10 11:48:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:24,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76684103] [2023-11-10 11:48:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:26,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76684103] [2023-11-10 11:48:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76684103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:26,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:48:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340471009] [2023-11-10 11:48:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:26,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:48:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:26,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:48:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:48:26,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 112 [2023-11-10 11:48:26,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 109 transitions, 455 flow. Second operand has 15 states, 15 states have (on average 77.0) internal successors, (1155), 15 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:26,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:26,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 112 [2023-11-10 11:48:26,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:27,325 INFO L124 PetriNetUnfolderBase]: 56/391 cut-off events. [2023-11-10 11:48:27,326 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-11-10 11:48:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 391 events. 56/391 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2127 event pairs, 1 based on Foata normal form. 2/390 useless extension candidates. Maximal degree in co-relation 931. Up to 48 conditions per place. [2023-11-10 11:48:27,328 INFO L140 encePairwiseOnDemand]: 99/112 looper letters, 30 selfloop transitions, 9 changer transitions 21/127 dead transitions. [2023-11-10 11:48:27,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 127 transitions, 718 flow [2023-11-10 11:48:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:48:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:48:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1101 transitions. [2023-11-10 11:48:27,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021683673469388 [2023-11-10 11:48:27,329 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1101 transitions. [2023-11-10 11:48:27,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1101 transitions. [2023-11-10 11:48:27,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:27,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1101 transitions. [2023-11-10 11:48:27,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 78.64285714285714) internal successors, (1101), 14 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:27,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:27,333 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:27,333 INFO L175 Difference]: Start difference. First operand has 145 places, 109 transitions, 455 flow. Second operand 14 states and 1101 transitions. [2023-11-10 11:48:27,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 127 transitions, 718 flow [2023-11-10 11:48:27,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 127 transitions, 650 flow, removed 15 selfloop flow, removed 16 redundant places. [2023-11-10 11:48:27,337 INFO L231 Difference]: Finished difference. Result has 143 places, 103 transitions, 389 flow [2023-11-10 11:48:27,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=389, PETRI_PLACES=143, PETRI_TRANSITIONS=103} [2023-11-10 11:48:27,338 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2023-11-10 11:48:27,338 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 103 transitions, 389 flow [2023-11-10 11:48:27,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.0) internal successors, (1155), 15 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:27,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:27,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-10 11:48:27,339 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:48:27,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1027325053, now seen corresponding path program 14 times [2023-11-10 11:48:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813375491] [2023-11-10 11:48:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:48:27,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:48:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:48:27,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:48:27,478 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:48:27,478 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-10 11:48:27,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-10 11:48:27,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-10 11:48:27,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-10 11:48:27,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-10 11:48:27,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-10 11:48:27,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-10 11:48:27,482 INFO L445 BasicCegarLoop]: Path program histogram: [14, 3, 2, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:27,491 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:48:27,491 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:48:27,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:48:27,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-10 11:48:27,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-10 11:48:27,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:48:27 BasicIcfg [2023-11-10 11:48:27,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:48:27,619 INFO L158 Benchmark]: Toolchain (without parser) took 42964.92ms. Allocated memory was 291.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 237.1MB in the beginning and 760.0MB in the end (delta: -522.9MB). Peak memory consumption was 631.1MB. Max. memory is 8.0GB. [2023-11-10 11:48:27,619 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 200.3MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:48:27,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.45ms. Allocated memory is still 291.5MB. Free memory was 236.6MB in the beginning and 210.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-10 11:48:27,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.46ms. Allocated memory is still 291.5MB. Free memory was 210.4MB in the beginning and 207.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:48:27,620 INFO L158 Benchmark]: Boogie Preprocessor took 43.34ms. Allocated memory is still 291.5MB. Free memory was 207.8MB in the beginning and 205.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:48:27,620 INFO L158 Benchmark]: RCFGBuilder took 837.86ms. Allocated memory is still 291.5MB. Free memory was 205.7MB in the beginning and 151.7MB in the end (delta: 54.0MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-11-10 11:48:27,620 INFO L158 Benchmark]: TraceAbstraction took 41453.92ms. Allocated memory was 291.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 151.1MB in the beginning and 760.0MB in the end (delta: -608.9MB). Peak memory consumption was 545.1MB. Max. memory is 8.0GB. [2023-11-10 11:48:27,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 200.3MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.45ms. Allocated memory is still 291.5MB. Free memory was 236.6MB in the beginning and 210.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.46ms. Allocated memory is still 291.5MB. Free memory was 210.4MB in the beginning and 207.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.34ms. Allocated memory is still 291.5MB. Free memory was 207.8MB in the beginning and 205.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 837.86ms. Allocated memory is still 291.5MB. Free memory was 205.7MB in the beginning and 151.7MB in the end (delta: 54.0MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * TraceAbstraction took 41453.92ms. Allocated memory was 291.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 151.1MB in the beginning and 760.0MB in the end (delta: -608.9MB). Peak memory consumption was 545.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L732] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L733] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y=0] [L734] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L735] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L736] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L737] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L738] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L854] 0 pthread_t t2321; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.2s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1379 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1379 mSDsluCounter, 2345 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1972 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5200 IncrementalHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 373 mSDtfsCounter, 5200 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1072occurred in iteration=8, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 2005 NumberOfCodeBlocks, 2005 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1896 ConstructedInterpolants, 0 QuantifiedInterpolants, 15441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-10 11:48:27,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...