/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/safe017_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:14,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:47:14,186 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:14,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:47:14,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:47:14,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:47:14,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:47:14,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:47:14,223 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:47:14,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:47:14,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:47:14,227 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:47:14,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:47:14,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:47:14,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:47:14,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:47:14,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:47:14,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:47:14,230 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:47:14,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:47:14,230 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:47:14,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:47:14,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:47:14,231 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:47:14,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:47:14,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:47:14,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:47:14,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:47:14,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:47:14,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:47:14,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:47:14,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:47:14,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:47:14,234 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:14,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:47:14,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:47:14,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:47:14,519 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:47:14,520 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:47:14,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:47:15,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:47:15,996 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:47:15,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:47:16,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6733ac82/531353dd6fb24b59abafef44c8807116/FLAG45f790a4a [2023-11-10 11:47:16,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6733ac82/531353dd6fb24b59abafef44c8807116 [2023-11-10 11:47:16,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:47:16,028 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:47:16,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:47:16,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:47:16,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:47:16,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:47:16" (1/1) ... [2023-11-10 11:47:16,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fa75da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:16, skipping insertion in model container [2023-11-10 11:47:16,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:47:16" (1/1) ... [2023-11-10 11:47:16,090 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:47:16,225 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-10 11:47:16,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:47:16,428 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:47:16,447 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-10 11:47:16,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:47:16,541 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:47:16,541 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:47:16,547 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:47:16,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:16 WrapperNode [2023-11-10 11:47:16,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:47:16,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:47:16,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:47:16,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:47:16,555 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:16" (1/1) ... [2023-11-10 11:47:16,590 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:16" (1/1) ... [2023-11-10 11:47:16,618 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-11-10 11:47:16,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:47:16,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:47:16,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:47:16,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:47:16,627 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:16" (1/1) ... [2023-11-10 11:47:16,627 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:16" (1/1) ... [2023-11-10 11:47:16,630 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:16" (1/1) ... [2023-11-10 11:47:16,630 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:16" (1/1) ... [2023-11-10 11:47:16,636 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:16" (1/1) ... [2023-11-10 11:47:16,638 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:16" (1/1) ... [2023-11-10 11:47:16,640 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:16" (1/1) ... [2023-11-10 11:47:16,641 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:16" (1/1) ... [2023-11-10 11:47:16,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:47:16,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:47:16,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:47:16,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:47:16,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:16" (1/1) ... [2023-11-10 11:47:16,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:47:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:47:16,679 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:16,688 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:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:47:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:47:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:47:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:47:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:47:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:47:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:47:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:47:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:47:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:47:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:47:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:47:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:47:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:47:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:47:16,711 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:16,845 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:47:16,847 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:47:17,068 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:47:17,214 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:47:17,214 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:47:17,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:47:17 BoogieIcfgContainer [2023-11-10 11:47:17,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:47:17,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:47:17,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:47:17,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:47:17,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:47:16" (1/3) ... [2023-11-10 11:47:17,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d1daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:47:17, skipping insertion in model container [2023-11-10 11:47:17,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:47:16" (2/3) ... [2023-11-10 11:47:17,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d1daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:47:17, skipping insertion in model container [2023-11-10 11:47:17,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:47:17" (3/3) ... [2023-11-10 11:47:17,227 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:47:17,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:47:17,243 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:47:17,243 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:47:17,299 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:47:17,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 230 flow [2023-11-10 11:47:17,384 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-10 11:47:17,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:47:17,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-10 11:47:17,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 109 transitions, 230 flow [2023-11-10 11:47:17,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 106 transitions, 221 flow [2023-11-10 11:47:17,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:47:17,411 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;@6ce2fa95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:47:17,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-10 11:47:17,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:47:17,421 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-11-10 11:47:17,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:47:17,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:17,422 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] [2023-11-10 11:47:17,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:17,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1312039533, now seen corresponding path program 1 times [2023-11-10 11:47:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:17,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045351543] [2023-11-10 11:47:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:17,924 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:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045351543] [2023-11-10 11:47:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045351543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:17,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:47:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775703361] [2023-11-10 11:47:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:17,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:47:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:17,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:47:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:47:17,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2023-11-10 11:47:17,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:17,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:17,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2023-11-10 11:47:17,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:18,183 INFO L124 PetriNetUnfolderBase]: 58/320 cut-off events. [2023-11-10 11:47:18,183 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-10 11:47:18,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 320 events. 58/320 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1318 event pairs, 10 based on Foata normal form. 13/314 useless extension candidates. Maximal degree in co-relation 403. Up to 79 conditions per place. [2023-11-10 11:47:18,193 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 14 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2023-11-10 11:47:18,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 261 flow [2023-11-10 11:47:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:47:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:47:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-11-10 11:47:18,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9296636085626911 [2023-11-10 11:47:18,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-11-10 11:47:18,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-11-10 11:47:18,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:18,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-11-10 11:47:18,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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:18,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:18,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:18,223 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 221 flow. Second operand 3 states and 304 transitions. [2023-11-10 11:47:18,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 261 flow [2023-11-10 11:47:18,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-10 11:47:18,229 INFO L231 Difference]: Finished difference. Result has 110 places, 101 transitions, 212 flow [2023-11-10 11:47:18,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=110, PETRI_TRANSITIONS=101} [2023-11-10 11:47:18,235 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2023-11-10 11:47:18,235 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 212 flow [2023-11-10 11:47:18,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:18,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:18,236 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] [2023-11-10 11:47:18,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:47:18,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:18,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash 469891522, now seen corresponding path program 1 times [2023-11-10 11:47:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:18,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511532741] [2023-11-10 11:47:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:19,659 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:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511532741] [2023-11-10 11:47:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511532741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:19,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:47:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725117087] [2023-11-10 11:47:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:19,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:47:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:47:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:47:19,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-10 11:47:19,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 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:19,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:19,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-10 11:47:19,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:20,805 INFO L124 PetriNetUnfolderBase]: 1812/3671 cut-off events. [2023-11-10 11:47:20,805 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-10 11:47:20,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 3671 events. 1812/3671 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24622 event pairs, 259 based on Foata normal form. 0/3563 useless extension candidates. Maximal degree in co-relation 6550. Up to 1198 conditions per place. [2023-11-10 11:47:20,826 INFO L140 encePairwiseOnDemand]: 95/109 looper letters, 35 selfloop transitions, 8 changer transitions 90/194 dead transitions. [2023-11-10 11:47:20,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 194 transitions, 658 flow [2023-11-10 11:47:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:47:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:47:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1088 transitions. [2023-11-10 11:47:20,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7678193366266761 [2023-11-10 11:47:20,832 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1088 transitions. [2023-11-10 11:47:20,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1088 transitions. [2023-11-10 11:47:20,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:20,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1088 transitions. [2023-11-10 11:47:20,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 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:20,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 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:20,842 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 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:20,842 INFO L175 Difference]: Start difference. First operand has 110 places, 101 transitions, 212 flow. Second operand 13 states and 1088 transitions. [2023-11-10 11:47:20,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 194 transitions, 658 flow [2023-11-10 11:47:20,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:47:20,847 INFO L231 Difference]: Finished difference. Result has 132 places, 94 transitions, 290 flow [2023-11-10 11:47:20,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=290, PETRI_PLACES=132, PETRI_TRANSITIONS=94} [2023-11-10 11:47:20,848 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 19 predicate places. [2023-11-10 11:47:20,849 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 94 transitions, 290 flow [2023-11-10 11:47:20,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 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:20,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:20,849 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:20,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:47:20,850 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:20,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1966613281, now seen corresponding path program 1 times [2023-11-10 11:47:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139728067] [2023-11-10 11:47:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:21,669 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:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139728067] [2023-11-10 11:47:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139728067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:47:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91452518] [2023-11-10 11:47:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:21,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:47:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:47:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:47:21,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-10 11:47:21,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 94 transitions, 290 flow. Second operand has 8 states, 8 states have (on average 76.5) internal successors, (612), 8 states have internal predecessors, (612), 0 states have call successors, (0), 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:21,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:21,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-10 11:47:21,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:22,278 INFO L124 PetriNetUnfolderBase]: 1045/1964 cut-off events. [2023-11-10 11:47:22,278 INFO L125 PetriNetUnfolderBase]: For 4989/6871 co-relation queries the response was YES. [2023-11-10 11:47:22,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7343 conditions, 1964 events. 1045/1964 cut-off events. For 4989/6871 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11192 event pairs, 150 based on Foata normal form. 49/1918 useless extension candidates. Maximal degree in co-relation 7277. Up to 901 conditions per place. [2023-11-10 11:47:22,295 INFO L140 encePairwiseOnDemand]: 96/109 looper letters, 38 selfloop transitions, 10 changer transitions 68/177 dead transitions. [2023-11-10 11:47:22,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 177 transitions, 1046 flow [2023-11-10 11:47:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:47:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:47:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 913 transitions. [2023-11-10 11:47:22,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7614678899082569 [2023-11-10 11:47:22,298 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 913 transitions. [2023-11-10 11:47:22,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 913 transitions. [2023-11-10 11:47:22,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:22,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 913 transitions. [2023-11-10 11:47:22,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.0) internal successors, (913), 11 states have internal predecessors, (913), 0 states have call successors, (0), 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:22,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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:22,305 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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:22,305 INFO L175 Difference]: Start difference. First operand has 132 places, 94 transitions, 290 flow. Second operand 11 states and 913 transitions. [2023-11-10 11:47:22,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 177 transitions, 1046 flow [2023-11-10 11:47:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 177 transitions, 1003 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-11-10 11:47:22,323 INFO L231 Difference]: Finished difference. Result has 124 places, 95 transitions, 344 flow [2023-11-10 11:47:22,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=344, PETRI_PLACES=124, PETRI_TRANSITIONS=95} [2023-11-10 11:47:22,325 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 11 predicate places. [2023-11-10 11:47:22,325 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 95 transitions, 344 flow [2023-11-10 11:47:22,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.5) internal successors, (612), 8 states have internal predecessors, (612), 0 states have call successors, (0), 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:22,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:22,325 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] [2023-11-10 11:47:22,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:47:22,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:22,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash 548055918, now seen corresponding path program 1 times [2023-11-10 11:47:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585256823] [2023-11-10 11:47:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:23,270 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:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585256823] [2023-11-10 11:47:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585256823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:23,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:23,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:47:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861496651] [2023-11-10 11:47:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:23,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:47:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:47:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:47:23,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-10 11:47:23,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 95 transitions, 344 flow. Second operand has 9 states, 9 states have (on average 76.33333333333333) internal successors, (687), 9 states have internal predecessors, (687), 0 states have call successors, (0), 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:23,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:23,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-10 11:47:23,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:24,271 INFO L124 PetriNetUnfolderBase]: 766/1562 cut-off events. [2023-11-10 11:47:24,272 INFO L125 PetriNetUnfolderBase]: For 5466/6729 co-relation queries the response was YES. [2023-11-10 11:47:24,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6223 conditions, 1562 events. 766/1562 cut-off events. For 5466/6729 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8837 event pairs, 117 based on Foata normal form. 34/1541 useless extension candidates. Maximal degree in co-relation 6149. Up to 700 conditions per place. [2023-11-10 11:47:24,286 INFO L140 encePairwiseOnDemand]: 90/109 looper letters, 40 selfloop transitions, 39 changer transitions 83/223 dead transitions. [2023-11-10 11:47:24,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 223 transitions, 1548 flow [2023-11-10 11:47:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-10 11:47:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-10 11:47:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1850 transitions. [2023-11-10 11:47:24,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7379337854008775 [2023-11-10 11:47:24,291 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1850 transitions. [2023-11-10 11:47:24,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1850 transitions. [2023-11-10 11:47:24,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:24,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1850 transitions. [2023-11-10 11:47:24,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 80.43478260869566) internal successors, (1850), 23 states have internal predecessors, (1850), 0 states have call successors, (0), 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:24,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 109.0) internal successors, (2616), 24 states have internal predecessors, (2616), 0 states have call successors, (0), 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:24,302 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 109.0) internal successors, (2616), 24 states have internal predecessors, (2616), 0 states have call successors, (0), 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:24,303 INFO L175 Difference]: Start difference. First operand has 124 places, 95 transitions, 344 flow. Second operand 23 states and 1850 transitions. [2023-11-10 11:47:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 223 transitions, 1548 flow [2023-11-10 11:47:24,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 223 transitions, 1328 flow, removed 71 selfloop flow, removed 12 redundant places. [2023-11-10 11:47:24,320 INFO L231 Difference]: Finished difference. Result has 147 places, 124 transitions, 668 flow [2023-11-10 11:47:24,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=668, PETRI_PLACES=147, PETRI_TRANSITIONS=124} [2023-11-10 11:47:24,322 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 34 predicate places. [2023-11-10 11:47:24,322 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 124 transitions, 668 flow [2023-11-10 11:47:24,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 76.33333333333333) internal successors, (687), 9 states have internal predecessors, (687), 0 states have call successors, (0), 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:24,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:24,323 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] [2023-11-10 11:47:24,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:47:24,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:24,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 519829451, now seen corresponding path program 1 times [2023-11-10 11:47:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519174789] [2023-11-10 11:47:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:25,622 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:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519174789] [2023-11-10 11:47:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519174789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:47:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623325412] [2023-11-10 11:47:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:25,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:47:25,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:47:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:47:25,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-10 11:47:25,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 124 transitions, 668 flow. Second operand has 12 states, 12 states have (on average 75.83333333333333) internal successors, (910), 12 states have internal predecessors, (910), 0 states have call successors, (0), 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:25,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:25,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-10 11:47:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:26,630 INFO L124 PetriNetUnfolderBase]: 833/1702 cut-off events. [2023-11-10 11:47:26,631 INFO L125 PetriNetUnfolderBase]: For 11426/14194 co-relation queries the response was YES. [2023-11-10 11:47:26,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8696 conditions, 1702 events. 833/1702 cut-off events. For 11426/14194 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9801 event pairs, 126 based on Foata normal form. 69/1713 useless extension candidates. Maximal degree in co-relation 8605. Up to 728 conditions per place. [2023-11-10 11:47:26,649 INFO L140 encePairwiseOnDemand]: 90/109 looper letters, 45 selfloop transitions, 41 changer transitions 71/218 dead transitions. [2023-11-10 11:47:26,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 218 transitions, 1921 flow [2023-11-10 11:47:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:47:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:47:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1531 transitions. [2023-11-10 11:47:26,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7392563978754225 [2023-11-10 11:47:26,653 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1531 transitions. [2023-11-10 11:47:26,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1531 transitions. [2023-11-10 11:47:26,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:26,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1531 transitions. [2023-11-10 11:47:26,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 80.57894736842105) internal successors, (1531), 19 states have internal predecessors, (1531), 0 states have call successors, (0), 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:26,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 109.0) internal successors, (2180), 20 states have internal predecessors, (2180), 0 states have call successors, (0), 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:26,662 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 109.0) internal successors, (2180), 20 states have internal predecessors, (2180), 0 states have call successors, (0), 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:26,662 INFO L175 Difference]: Start difference. First operand has 147 places, 124 transitions, 668 flow. Second operand 19 states and 1531 transitions. [2023-11-10 11:47:26,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 218 transitions, 1921 flow [2023-11-10 11:47:26,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 218 transitions, 1725 flow, removed 96 selfloop flow, removed 17 redundant places. [2023-11-10 11:47:26,695 INFO L231 Difference]: Finished difference. Result has 144 places, 132 transitions, 858 flow [2023-11-10 11:47:26,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=858, PETRI_PLACES=144, PETRI_TRANSITIONS=132} [2023-11-10 11:47:26,696 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 31 predicate places. [2023-11-10 11:47:26,696 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 132 transitions, 858 flow [2023-11-10 11:47:26,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.83333333333333) internal successors, (910), 12 states have internal predecessors, (910), 0 states have call successors, (0), 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:26,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:26,697 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] [2023-11-10 11:47:26,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:47:26,697 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:26,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1070546653, now seen corresponding path program 2 times [2023-11-10 11:47:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53146561] [2023-11-10 11:47:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:26,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:27,427 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:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53146561] [2023-11-10 11:47:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53146561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:27,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:47:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480059619] [2023-11-10 11:47:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:27,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:47:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:47:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:47:27,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-10 11:47:27,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 132 transitions, 858 flow. Second operand has 8 states, 8 states have (on average 76.75) internal successors, (614), 8 states have internal predecessors, (614), 0 states have call successors, (0), 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:27,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:27,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-10 11:47:27,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:28,103 INFO L124 PetriNetUnfolderBase]: 959/1990 cut-off events. [2023-11-10 11:47:28,103 INFO L125 PetriNetUnfolderBase]: For 21636/37878 co-relation queries the response was YES. [2023-11-10 11:47:28,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12211 conditions, 1990 events. 959/1990 cut-off events. For 21636/37878 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12173 event pairs, 114 based on Foata normal form. 61/1969 useless extension candidates. Maximal degree in co-relation 12119. Up to 936 conditions per place. [2023-11-10 11:47:28,123 INFO L140 encePairwiseOnDemand]: 100/109 looper letters, 58 selfloop transitions, 8 changer transitions 97/224 dead transitions. [2023-11-10 11:47:28,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 224 transitions, 2446 flow [2023-11-10 11:47:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:47:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:47:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1215 transitions. [2023-11-10 11:47:28,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7431192660550459 [2023-11-10 11:47:28,128 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1215 transitions. [2023-11-10 11:47:28,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1215 transitions. [2023-11-10 11:47:28,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:28,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1215 transitions. [2023-11-10 11:47:28,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 81.0) internal successors, (1215), 15 states have internal predecessors, (1215), 0 states have call successors, (0), 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:28,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 109.0) internal successors, (1744), 16 states have internal predecessors, (1744), 0 states have call successors, (0), 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:28,139 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 109.0) internal successors, (1744), 16 states have internal predecessors, (1744), 0 states have call successors, (0), 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:28,139 INFO L175 Difference]: Start difference. First operand has 144 places, 132 transitions, 858 flow. Second operand 15 states and 1215 transitions. [2023-11-10 11:47:28,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 224 transitions, 2446 flow [2023-11-10 11:47:28,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 224 transitions, 2129 flow, removed 153 selfloop flow, removed 11 redundant places. [2023-11-10 11:47:28,176 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 669 flow [2023-11-10 11:47:28,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=669, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2023-11-10 11:47:28,179 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 37 predicate places. [2023-11-10 11:47:28,179 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 669 flow [2023-11-10 11:47:28,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.75) internal successors, (614), 8 states have internal predecessors, (614), 0 states have call successors, (0), 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:28,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:28,180 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] [2023-11-10 11:47:28,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:47:28,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:28,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 739320428, now seen corresponding path program 1 times [2023-11-10 11:47:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109170506] [2023-11-10 11:47:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:29,253 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:29,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:29,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109170506] [2023-11-10 11:47:29,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109170506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:29,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:29,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:47:29,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790925198] [2023-11-10 11:47:29,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:29,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:47:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:47:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:47:29,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-10 11:47:29,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 669 flow. Second operand has 10 states, 10 states have (on average 76.2) internal successors, (762), 10 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:29,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:29,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-10 11:47:29,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:30,016 INFO L124 PetriNetUnfolderBase]: 734/1695 cut-off events. [2023-11-10 11:47:30,016 INFO L125 PetriNetUnfolderBase]: For 11776/14478 co-relation queries the response was YES. [2023-11-10 11:47:30,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8620 conditions, 1695 events. 734/1695 cut-off events. For 11776/14478 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10919 event pairs, 74 based on Foata normal form. 49/1694 useless extension candidates. Maximal degree in co-relation 8588. Up to 707 conditions per place. [2023-11-10 11:47:30,039 INFO L140 encePairwiseOnDemand]: 94/109 looper letters, 50 selfloop transitions, 32 changer transitions 65/208 dead transitions. [2023-11-10 11:47:30,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 208 transitions, 2010 flow [2023-11-10 11:47:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:47:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:47:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1597 transitions. [2023-11-10 11:47:30,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7325688073394495 [2023-11-10 11:47:30,046 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1597 transitions. [2023-11-10 11:47:30,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1597 transitions. [2023-11-10 11:47:30,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:30,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1597 transitions. [2023-11-10 11:47:30,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 79.85) internal successors, (1597), 20 states have internal predecessors, (1597), 0 states have call successors, (0), 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:30,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 109.0) internal successors, (2289), 21 states have internal predecessors, (2289), 0 states have call successors, (0), 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:30,056 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 109.0) internal successors, (2289), 21 states have internal predecessors, (2289), 0 states have call successors, (0), 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:30,056 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 669 flow. Second operand 20 states and 1597 transitions. [2023-11-10 11:47:30,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 208 transitions, 2010 flow [2023-11-10 11:47:30,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 208 transitions, 1711 flow, removed 93 selfloop flow, removed 17 redundant places. [2023-11-10 11:47:30,084 INFO L231 Difference]: Finished difference. Result has 156 places, 124 transitions, 826 flow [2023-11-10 11:47:30,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=826, PETRI_PLACES=156, PETRI_TRANSITIONS=124} [2023-11-10 11:47:30,086 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 43 predicate places. [2023-11-10 11:47:30,086 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 124 transitions, 826 flow [2023-11-10 11:47:30,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 76.2) internal successors, (762), 10 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:30,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:30,087 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:30,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:47:30,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:30,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 451975619, now seen corresponding path program 1 times [2023-11-10 11:47:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660395204] [2023-11-10 11:47:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:30,647 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:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:30,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660395204] [2023-11-10 11:47:30,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660395204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:30,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:30,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:47:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708159410] [2023-11-10 11:47:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:30,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:47:30,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:47:30,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:47:30,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2023-11-10 11:47:30,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 124 transitions, 826 flow. Second operand has 9 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 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:30,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:30,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2023-11-10 11:47:30,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:31,217 INFO L124 PetriNetUnfolderBase]: 575/1364 cut-off events. [2023-11-10 11:47:31,218 INFO L125 PetriNetUnfolderBase]: For 22629/25322 co-relation queries the response was YES. [2023-11-10 11:47:31,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9312 conditions, 1364 events. 575/1364 cut-off events. For 22629/25322 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8703 event pairs, 104 based on Foata normal form. 159/1489 useless extension candidates. Maximal degree in co-relation 9277. Up to 568 conditions per place. [2023-11-10 11:47:31,236 INFO L140 encePairwiseOnDemand]: 96/109 looper letters, 51 selfloop transitions, 22 changer transitions 85/233 dead transitions. [2023-11-10 11:47:31,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 233 transitions, 2680 flow [2023-11-10 11:47:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:47:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:47:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1375 transitions. [2023-11-10 11:47:31,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7884174311926605 [2023-11-10 11:47:31,239 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1375 transitions. [2023-11-10 11:47:31,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1375 transitions. [2023-11-10 11:47:31,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:31,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1375 transitions. [2023-11-10 11:47:31,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.9375) internal successors, (1375), 16 states have internal predecessors, (1375), 0 states have call successors, (0), 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:31,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 109.0) internal successors, (1853), 17 states have internal predecessors, (1853), 0 states have call successors, (0), 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:31,247 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 109.0) internal successors, (1853), 17 states have internal predecessors, (1853), 0 states have call successors, (0), 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:31,247 INFO L175 Difference]: Start difference. First operand has 156 places, 124 transitions, 826 flow. Second operand 16 states and 1375 transitions. [2023-11-10 11:47:31,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 233 transitions, 2680 flow [2023-11-10 11:47:31,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 233 transitions, 2401 flow, removed 137 selfloop flow, removed 12 redundant places. [2023-11-10 11:47:31,281 INFO L231 Difference]: Finished difference. Result has 159 places, 142 transitions, 1157 flow [2023-11-10 11:47:31,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1157, PETRI_PLACES=159, PETRI_TRANSITIONS=142} [2023-11-10 11:47:31,283 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 46 predicate places. [2023-11-10 11:47:31,284 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 142 transitions, 1157 flow [2023-11-10 11:47:31,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 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:31,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:31,284 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:31,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:47:31,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:31,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1495628060, now seen corresponding path program 1 times [2023-11-10 11:47:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546590038] [2023-11-10 11:47:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:32,391 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:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546590038] [2023-11-10 11:47:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546590038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:47:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902439994] [2023-11-10 11:47:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:32,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:47:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:47:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:47:32,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 109 [2023-11-10 11:47:32,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 142 transitions, 1157 flow. Second operand has 12 states, 12 states have (on average 75.0) internal successors, (900), 12 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:32,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:32,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 109 [2023-11-10 11:47:32,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:33,159 INFO L124 PetriNetUnfolderBase]: 442/1095 cut-off events. [2023-11-10 11:47:33,160 INFO L125 PetriNetUnfolderBase]: For 17801/21416 co-relation queries the response was YES. [2023-11-10 11:47:33,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7691 conditions, 1095 events. 442/1095 cut-off events. For 17801/21416 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6274 event pairs, 121 based on Foata normal form. 39/1075 useless extension candidates. Maximal degree in co-relation 7653. Up to 540 conditions per place. [2023-11-10 11:47:33,174 INFO L140 encePairwiseOnDemand]: 92/109 looper letters, 70 selfloop transitions, 30 changer transitions 52/212 dead transitions. [2023-11-10 11:47:33,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 212 transitions, 2660 flow [2023-11-10 11:47:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-10 11:47:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-10 11:47:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1413 transitions. [2023-11-10 11:47:33,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7201834862385321 [2023-11-10 11:47:33,177 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1413 transitions. [2023-11-10 11:47:33,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1413 transitions. [2023-11-10 11:47:33,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:33,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1413 transitions. [2023-11-10 11:47:33,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 78.5) internal successors, (1413), 18 states have internal predecessors, (1413), 0 states have call successors, (0), 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:33,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 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:33,184 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 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:33,184 INFO L175 Difference]: Start difference. First operand has 159 places, 142 transitions, 1157 flow. Second operand 18 states and 1413 transitions. [2023-11-10 11:47:33,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 212 transitions, 2660 flow [2023-11-10 11:47:33,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 212 transitions, 2606 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-11-10 11:47:33,213 INFO L231 Difference]: Finished difference. Result has 173 places, 147 transitions, 1355 flow [2023-11-10 11:47:33,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1355, PETRI_PLACES=173, PETRI_TRANSITIONS=147} [2023-11-10 11:47:33,215 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 60 predicate places. [2023-11-10 11:47:33,215 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 147 transitions, 1355 flow [2023-11-10 11:47:33,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.0) internal successors, (900), 12 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:47:33,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:33,216 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] [2023-11-10 11:47:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:47:33,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:33,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash -356429339, now seen corresponding path program 1 times [2023-11-10 11:47:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:33,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557666151] [2023-11-10 11:47:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:34,455 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:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557666151] [2023-11-10 11:47:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557666151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:34,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-10 11:47:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92673202] [2023-11-10 11:47:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-10 11:47:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-10 11:47:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-10 11:47:34,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 109 [2023-11-10 11:47:34,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 147 transitions, 1355 flow. Second operand has 14 states, 14 states have (on average 74.71428571428571) internal successors, (1046), 14 states have internal predecessors, (1046), 0 states have call successors, (0), 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:34,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:34,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 109 [2023-11-10 11:47:34,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:35,272 INFO L124 PetriNetUnfolderBase]: 379/1002 cut-off events. [2023-11-10 11:47:35,273 INFO L125 PetriNetUnfolderBase]: For 21473/28496 co-relation queries the response was YES. [2023-11-10 11:47:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7860 conditions, 1002 events. 379/1002 cut-off events. For 21473/28496 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5893 event pairs, 72 based on Foata normal form. 40/996 useless extension candidates. Maximal degree in co-relation 7813. Up to 413 conditions per place. [2023-11-10 11:47:35,288 INFO L140 encePairwiseOnDemand]: 90/109 looper letters, 60 selfloop transitions, 45 changer transitions 60/225 dead transitions. [2023-11-10 11:47:35,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 225 transitions, 3152 flow [2023-11-10 11:47:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:47:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:47:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1558 transitions. [2023-11-10 11:47:35,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7146788990825688 [2023-11-10 11:47:35,296 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1558 transitions. [2023-11-10 11:47:35,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1558 transitions. [2023-11-10 11:47:35,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:35,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1558 transitions. [2023-11-10 11:47:35,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 77.9) internal successors, (1558), 20 states have internal predecessors, (1558), 0 states have call successors, (0), 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:35,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 109.0) internal successors, (2289), 21 states have internal predecessors, (2289), 0 states have call successors, (0), 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:35,303 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 109.0) internal successors, (2289), 21 states have internal predecessors, (2289), 0 states have call successors, (0), 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:35,303 INFO L175 Difference]: Start difference. First operand has 173 places, 147 transitions, 1355 flow. Second operand 20 states and 1558 transitions. [2023-11-10 11:47:35,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 225 transitions, 3152 flow [2023-11-10 11:47:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 225 transitions, 3029 flow, removed 58 selfloop flow, removed 13 redundant places. [2023-11-10 11:47:35,344 INFO L231 Difference]: Finished difference. Result has 181 places, 153 transitions, 1606 flow [2023-11-10 11:47:35,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1606, PETRI_PLACES=181, PETRI_TRANSITIONS=153} [2023-11-10 11:47:35,346 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 68 predicate places. [2023-11-10 11:47:35,346 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 153 transitions, 1606 flow [2023-11-10 11:47:35,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 74.71428571428571) internal successors, (1046), 14 states have internal predecessors, (1046), 0 states have call successors, (0), 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:35,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:35,347 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:35,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:47:35,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:35,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1002078358, now seen corresponding path program 1 times [2023-11-10 11:47:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:35,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524401982] [2023-11-10 11:47:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:35,536 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:35,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524401982] [2023-11-10 11:47:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524401982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:47:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143540545] [2023-11-10 11:47:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:35,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:47:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:47:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:47:35,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2023-11-10 11:47:35,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 153 transitions, 1606 flow. Second operand has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 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:35,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:35,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2023-11-10 11:47:35,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:36,329 INFO L124 PetriNetUnfolderBase]: 2092/3942 cut-off events. [2023-11-10 11:47:36,329 INFO L125 PetriNetUnfolderBase]: For 111713/112975 co-relation queries the response was YES. [2023-11-10 11:47:36,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26355 conditions, 3942 events. 2092/3942 cut-off events. For 111713/112975 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27207 event pairs, 209 based on Foata normal form. 574/4375 useless extension candidates. Maximal degree in co-relation 26306. Up to 1457 conditions per place. [2023-11-10 11:47:36,365 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 88 selfloop transitions, 6 changer transitions 147/315 dead transitions. [2023-11-10 11:47:36,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 315 transitions, 5351 flow [2023-11-10 11:47:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:47:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:47:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 904 transitions. [2023-11-10 11:47:36,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8293577981651377 [2023-11-10 11:47:36,369 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 904 transitions. [2023-11-10 11:47:36,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 904 transitions. [2023-11-10 11:47:36,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:36,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 904 transitions. [2023-11-10 11:47:36,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 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:36,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 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:36,373 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 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:36,373 INFO L175 Difference]: Start difference. First operand has 181 places, 153 transitions, 1606 flow. Second operand 10 states and 904 transitions. [2023-11-10 11:47:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 315 transitions, 5351 flow [2023-11-10 11:47:36,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 315 transitions, 4789 flow, removed 173 selfloop flow, removed 21 redundant places. [2023-11-10 11:47:36,473 INFO L231 Difference]: Finished difference. Result has 166 places, 131 transitions, 1124 flow [2023-11-10 11:47:36,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1124, PETRI_PLACES=166, PETRI_TRANSITIONS=131} [2023-11-10 11:47:36,474 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 53 predicate places. [2023-11-10 11:47:36,474 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 131 transitions, 1124 flow [2023-11-10 11:47:36,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 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:36,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:36,475 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] [2023-11-10 11:47:36,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:47:36,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:36,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1938256931, now seen corresponding path program 1 times [2023-11-10 11:47:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946902715] [2023-11-10 11:47:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:36,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:36,636 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:36,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946902715] [2023-11-10 11:47:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946902715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:36,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:47:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956898590] [2023-11-10 11:47:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:36,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:47:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:47:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:47:36,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2023-11-10 11:47:36,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 131 transitions, 1124 flow. Second operand has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 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:36,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:36,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2023-11-10 11:47:36,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:37,039 INFO L124 PetriNetUnfolderBase]: 635/1510 cut-off events. [2023-11-10 11:47:37,039 INFO L125 PetriNetUnfolderBase]: For 30650/30969 co-relation queries the response was YES. [2023-11-10 11:47:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9438 conditions, 1510 events. 635/1510 cut-off events. For 30650/30969 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9776 event pairs, 17 based on Foata normal form. 246/1739 useless extension candidates. Maximal degree in co-relation 9396. Up to 409 conditions per place. [2023-11-10 11:47:37,051 INFO L140 encePairwiseOnDemand]: 100/109 looper letters, 74 selfloop transitions, 9 changer transitions 76/233 dead transitions. [2023-11-10 11:47:37,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 233 transitions, 3350 flow [2023-11-10 11:47:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:47:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:47:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 902 transitions. [2023-11-10 11:47:37,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8275229357798165 [2023-11-10 11:47:37,053 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 902 transitions. [2023-11-10 11:47:37,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 902 transitions. [2023-11-10 11:47:37,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:37,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 902 transitions. [2023-11-10 11:47:37,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.2) internal successors, (902), 10 states have internal predecessors, (902), 0 states have call successors, (0), 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:37,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 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:37,057 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 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:37,058 INFO L175 Difference]: Start difference. First operand has 166 places, 131 transitions, 1124 flow. Second operand 10 states and 902 transitions. [2023-11-10 11:47:37,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 233 transitions, 3350 flow [2023-11-10 11:47:37,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 233 transitions, 3211 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-11-10 11:47:37,094 INFO L231 Difference]: Finished difference. Result has 167 places, 125 transitions, 1011 flow [2023-11-10 11:47:37,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1011, PETRI_PLACES=167, PETRI_TRANSITIONS=125} [2023-11-10 11:47:37,095 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 54 predicate places. [2023-11-10 11:47:37,095 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 125 transitions, 1011 flow [2023-11-10 11:47:37,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 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:37,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:37,095 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:37,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:47:37,096 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:37,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash 638654346, now seen corresponding path program 1 times [2023-11-10 11:47:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:37,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061863282] [2023-11-10 11:47:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:37,271 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:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061863282] [2023-11-10 11:47:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061863282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:37,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:47:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123224076] [2023-11-10 11:47:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:37,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:47:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:47:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:47:37,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2023-11-10 11:47:37,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 125 transitions, 1011 flow. Second operand has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 0 states have call successors, (0), 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:37,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:37,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2023-11-10 11:47:37,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:37,542 INFO L124 PetriNetUnfolderBase]: 173/586 cut-off events. [2023-11-10 11:47:37,542 INFO L125 PetriNetUnfolderBase]: For 7836/7879 co-relation queries the response was YES. [2023-11-10 11:47:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 586 events. 173/586 cut-off events. For 7836/7879 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3067 event pairs, 12 based on Foata normal form. 33/606 useless extension candidates. Maximal degree in co-relation 3370. Up to 129 conditions per place. [2023-11-10 11:47:37,547 INFO L140 encePairwiseOnDemand]: 100/109 looper letters, 41 selfloop transitions, 12 changer transitions 52/175 dead transitions. [2023-11-10 11:47:37,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 175 transitions, 2102 flow [2023-11-10 11:47:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:47:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:47:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 963 transitions. [2023-11-10 11:47:37,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8031693077564637 [2023-11-10 11:47:37,549 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 963 transitions. [2023-11-10 11:47:37,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 963 transitions. [2023-11-10 11:47:37,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:37,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 963 transitions. [2023-11-10 11:47:37,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 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:37,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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:37,554 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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:37,554 INFO L175 Difference]: Start difference. First operand has 167 places, 125 transitions, 1011 flow. Second operand 11 states and 963 transitions. [2023-11-10 11:47:37,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 175 transitions, 2102 flow [2023-11-10 11:47:37,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 175 transitions, 1692 flow, removed 190 selfloop flow, removed 14 redundant places. [2023-11-10 11:47:37,577 INFO L231 Difference]: Finished difference. Result has 165 places, 108 transitions, 640 flow [2023-11-10 11:47:37,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=640, PETRI_PLACES=165, PETRI_TRANSITIONS=108} [2023-11-10 11:47:37,579 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 52 predicate places. [2023-11-10 11:47:37,579 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 108 transitions, 640 flow [2023-11-10 11:47:37,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 0 states have call successors, (0), 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:37,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:37,580 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] [2023-11-10 11:47:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:47:37,580 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:37,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -448532399, now seen corresponding path program 1 times [2023-11-10 11:47:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356612725] [2023-11-10 11:47:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:47:38,619 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:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:47:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356612725] [2023-11-10 11:47:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356612725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:47:38,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:47:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-10 11:47:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737691683] [2023-11-10 11:47:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:47:38,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-10 11:47:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:47:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-10 11:47:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-10 11:47:38,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2023-11-10 11:47:38,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 108 transitions, 640 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:38,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:47:38,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2023-11-10 11:47:38,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:47:38,865 INFO L124 PetriNetUnfolderBase]: 38/270 cut-off events. [2023-11-10 11:47:38,865 INFO L125 PetriNetUnfolderBase]: For 1300/1324 co-relation queries the response was YES. [2023-11-10 11:47:38,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 270 events. 38/270 cut-off events. For 1300/1324 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1080 event pairs, 0 based on Foata normal form. 3/268 useless extension candidates. Maximal degree in co-relation 1001. Up to 36 conditions per place. [2023-11-10 11:47:38,868 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 28 selfloop transitions, 7 changer transitions 16/121 dead transitions. [2023-11-10 11:47:38,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 121 transitions, 864 flow [2023-11-10 11:47:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:47:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:47:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 886 transitions. [2023-11-10 11:47:38,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7389491242702252 [2023-11-10 11:47:38,870 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 886 transitions. [2023-11-10 11:47:38,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 886 transitions. [2023-11-10 11:47:38,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:47:38,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 886 transitions. [2023-11-10 11:47:38,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.54545454545455) internal successors, (886), 11 states have internal predecessors, (886), 0 states have call successors, (0), 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:38,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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:38,873 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 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:38,873 INFO L175 Difference]: Start difference. First operand has 165 places, 108 transitions, 640 flow. Second operand 11 states and 886 transitions. [2023-11-10 11:47:38,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 121 transitions, 864 flow [2023-11-10 11:47:38,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 121 transitions, 568 flow, removed 103 selfloop flow, removed 37 redundant places. [2023-11-10 11:47:38,880 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 376 flow [2023-11-10 11:47:38,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2023-11-10 11:47:38,881 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 22 predicate places. [2023-11-10 11:47:38,881 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 376 flow [2023-11-10 11:47:38,881 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:47:38,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:47:38,882 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] [2023-11-10 11:47:38,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-10 11:47:38,882 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:47:38,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:47:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1741084691, now seen corresponding path program 2 times [2023-11-10 11:47:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:47:38,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483782866] [2023-11-10 11:47:38,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:47:38,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:47:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:47:38,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:47:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:47:38,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:47:38,985 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:47:38,985 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-10 11:47:38,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-10 11:47:38,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-10 11:47:38,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-10 11:47:38,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-10 11:47:38,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-10 11:47:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-10 11:47:38,987 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:47:38,993 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:47:38,993 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:47:39,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-10 11:47:39,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:47:39,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:47:39,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:47:39 BasicIcfg [2023-11-10 11:47:39,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:47:39,074 INFO L158 Benchmark]: Toolchain (without parser) took 23046.60ms. Allocated memory was 190.8MB in the beginning and 641.7MB in the end (delta: 450.9MB). Free memory was 139.6MB in the beginning and 484.9MB in the end (delta: -345.3MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. [2023-11-10 11:47:39,075 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 190.8MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:47:39,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.20ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 116.2MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-10 11:47:39,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.34ms. Allocated memory is still 190.8MB. Free memory was 116.2MB in the beginning and 113.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:47:39,075 INFO L158 Benchmark]: Boogie Preprocessor took 25.20ms. Allocated memory is still 190.8MB. Free memory was 113.4MB in the beginning and 111.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-10 11:47:39,076 INFO L158 Benchmark]: RCFGBuilder took 572.64ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 111.7MB in the beginning and 242.5MB in the end (delta: -130.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2023-11-10 11:47:39,076 INFO L158 Benchmark]: TraceAbstraction took 21854.74ms. Allocated memory was 302.0MB in the beginning and 641.7MB in the end (delta: 339.7MB). Free memory was 241.5MB in the beginning and 484.9MB in the end (delta: -243.4MB). Peak memory consumption was 96.3MB. Max. memory is 8.0GB. [2023-11-10 11:47:39,077 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.20ms. Allocated memory is still 190.8MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.20ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 116.2MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.34ms. Allocated memory is still 190.8MB. Free memory was 116.2MB in the beginning and 113.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.20ms. Allocated memory is still 190.8MB. Free memory was 113.4MB in the beginning and 111.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 572.64ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 111.7MB in the beginning and 242.5MB in the end (delta: -130.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * TraceAbstraction took 21854.74ms. Allocated memory was 302.0MB in the beginning and 641.7MB in the end (delta: 339.7MB). Free memory was 241.5MB in the beginning and 484.9MB in the end (delta: -243.4MB). Peak memory consumption was 96.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={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] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={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] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={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] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={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] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={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] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 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) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 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_p2_EAX=2, 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$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: 818]: 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: 814]: 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: 816]: 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, 134 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: 21.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1046 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1046 mSDsluCounter, 1334 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1072 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2164 IncrementalHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 262 mSDtfsCounter, 2164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1606occurred in iteration=10, InterpolantAutomatonStates: 200, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1073 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 7140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:47:39,098 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...