/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:17:10,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:17:10,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:17:10,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:17:10,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:17:10,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:17:10,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:17:10,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:17:10,403 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:17:10,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:17:10,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:17:10,407 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:17:10,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:17:10,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:17:10,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:17:10,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:17:10,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:17:10,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:17:10,408 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:17:10,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:17:10,409 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:17:10,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:17:10,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:17:10,410 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:17:10,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:17:10,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:17:10,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:17:10,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:17:10,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:17:10,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:17:10,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:17:10,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:17:10,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:17:10,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:17:10,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:17:10,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:17:10,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:17:10,637 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:17:10,638 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:17:10,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2023-12-09 15:17:11,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:17:11,956 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:17:11,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2023-12-09 15:17:11,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba8d7bab/32b5dfa25af64e77bc4762121b2cd88c/FLAG1fef8ee53 [2023-12-09 15:17:11,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba8d7bab/32b5dfa25af64e77bc4762121b2cd88c [2023-12-09 15:17:11,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:17:11,982 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:17:11,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:17:11,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:17:11,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:17:11,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:17:11" (1/1) ... [2023-12-09 15:17:11,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed49744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:11, skipping insertion in model container [2023-12-09 15:17:11,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:17:11" (1/1) ... [2023-12-09 15:17:12,025 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:17:12,170 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c[3538,3551] [2023-12-09 15:17:12,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:17:12,186 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:17:12,213 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c[3538,3551] [2023-12-09 15:17:12,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:17:12,220 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:17:12,220 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:17:12,225 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:17:12,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12 WrapperNode [2023-12-09 15:17:12,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:17:12,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:17:12,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:17:12,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:17:12,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,267 INFO L138 Inliner]: procedures = 21, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2023-12-09 15:17:12,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:17:12,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:17:12,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:17:12,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:17:12,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:17:12,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:17:12,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:17:12,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:17:12,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (1/1) ... [2023-12-09 15:17:12,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:17:12,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:17:12,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:17:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:17:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:17:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:17:12,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:17:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:17:12,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:17:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:17:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:17:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:17:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:17:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:17:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:17:12,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:17:12,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:17:12,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:17:12,371 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:17:12,434 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:17:12,436 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:17:12,603 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:17:12,656 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:17:12,656 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-09 15:17:12,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:17:12 BoogieIcfgContainer [2023-12-09 15:17:12,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:17:12,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:17:12,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:17:12,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:17:12,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:17:11" (1/3) ... [2023-12-09 15:17:12,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f589e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:17:12, skipping insertion in model container [2023-12-09 15:17:12,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:12" (2/3) ... [2023-12-09 15:17:12,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f589e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:17:12, skipping insertion in model container [2023-12-09 15:17:12,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:17:12" (3/3) ... [2023-12-09 15:17:12,663 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2023-12-09 15:17:12,674 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:17:12,674 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:17:12,674 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:17:12,710 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:17:12,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 113 transitions, 240 flow [2023-12-09 15:17:12,791 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2023-12-09 15:17:12,791 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:17:12,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 2/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-12-09 15:17:12,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 113 transitions, 240 flow [2023-12-09 15:17:12,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 102 transitions, 216 flow [2023-12-09 15:17:12,803 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:17:12,808 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@465b30b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:17:12,808 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:17:12,828 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:17:12,828 INFO L124 PetriNetUnfolderBase]: 2/101 cut-off events. [2023-12-09 15:17:12,828 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:17:12,828 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:12,829 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:12,829 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:12,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2039360794, now seen corresponding path program 1 times [2023-12-09 15:17:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100436277] [2023-12-09 15:17:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:13,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100436277] [2023-12-09 15:17:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100436277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:13,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:13,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:17:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326687795] [2023-12-09 15:17:13,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:13,583 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:17:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:13,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:17:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:17:13,606 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2023-12-09 15:17:13,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 216 flow. Second operand has 11 states, 11 states have (on average 78.9090909090909) internal successors, (868), 11 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:13,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:13,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2023-12-09 15:17:13,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:13,953 INFO L124 PetriNetUnfolderBase]: 33/262 cut-off events. [2023-12-09 15:17:13,953 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-12-09 15:17:13,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 262 events. 33/262 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 899 event pairs, 18 based on Foata normal form. 5/260 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2023-12-09 15:17:13,959 INFO L140 encePairwiseOnDemand]: 95/113 looper letters, 48 selfloop transitions, 13 changer transitions 15/142 dead transitions. [2023-12-09 15:17:13,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 142 transitions, 469 flow [2023-12-09 15:17:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:17:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:17:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1298 transitions. [2023-12-09 15:17:13,978 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7179203539823009 [2023-12-09 15:17:13,979 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1298 transitions. [2023-12-09 15:17:13,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1298 transitions. [2023-12-09 15:17:13,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:13,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1298 transitions. [2023-12-09 15:17:13,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 81.125) internal successors, (1298), 16 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:13,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:13,999 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,003 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2023-12-09 15:17:14,004 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 142 transitions, 469 flow [2023-12-09 15:17:14,004 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.9090909090909) internal successors, (868), 11 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,004 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:14,005 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:14,005 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:17:14,005 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:14,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1031247408, now seen corresponding path program 2 times [2023-12-09 15:17:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796682611] [2023-12-09 15:17:14,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796682611] [2023-12-09 15:17:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796682611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:17:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722048449] [2023-12-09 15:17:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:14,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:17:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:17:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:17:14,408 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:14,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 142 transitions, 469 flow. Second operand has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:14,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:14,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:14,581 INFO L124 PetriNetUnfolderBase]: 126/581 cut-off events. [2023-12-09 15:17:14,581 INFO L125 PetriNetUnfolderBase]: For 308/311 co-relation queries the response was YES. [2023-12-09 15:17:14,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 581 events. 126/581 cut-off events. For 308/311 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3123 event pairs, 22 based on Foata normal form. 6/570 useless extension candidates. Maximal degree in co-relation 911. Up to 125 conditions per place. [2023-12-09 15:17:14,585 INFO L140 encePairwiseOnDemand]: 100/113 looper letters, 93 selfloop transitions, 14 changer transitions 42/223 dead transitions. [2023-12-09 15:17:14,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 223 transitions, 1108 flow [2023-12-09 15:17:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 772 transitions. [2023-12-09 15:17:14,587 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7590953785644051 [2023-12-09 15:17:14,587 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 772 transitions. [2023-12-09 15:17:14,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 772 transitions. [2023-12-09 15:17:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:14,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 772 transitions. [2023-12-09 15:17:14,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.77777777777777) internal successors, (772), 9 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,591 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,591 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 23 predicate places. [2023-12-09 15:17:14,592 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 223 transitions, 1108 flow [2023-12-09 15:17:14,592 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,592 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:14,592 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:14,592 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:17:14,593 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:14,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 426374254, now seen corresponding path program 3 times [2023-12-09 15:17:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:14,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166700063] [2023-12-09 15:17:14,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166700063] [2023-12-09 15:17:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166700063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:17:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940800531] [2023-12-09 15:17:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:14,839 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:17:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:17:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:17:14,841 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2023-12-09 15:17:14,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 223 transitions, 1108 flow. Second operand has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:14,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:14,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2023-12-09 15:17:14,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:14,997 INFO L124 PetriNetUnfolderBase]: 132/605 cut-off events. [2023-12-09 15:17:14,997 INFO L125 PetriNetUnfolderBase]: For 607/632 co-relation queries the response was YES. [2023-12-09 15:17:15,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 605 events. 132/605 cut-off events. For 607/632 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3316 event pairs, 12 based on Foata normal form. 7/600 useless extension candidates. Maximal degree in co-relation 1044. Up to 186 conditions per place. [2023-12-09 15:17:15,003 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 67 selfloop transitions, 20 changer transitions 48/250 dead transitions. [2023-12-09 15:17:15,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 250 transitions, 1499 flow [2023-12-09 15:17:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:17:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:17:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2023-12-09 15:17:15,005 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8634639696586599 [2023-12-09 15:17:15,005 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2023-12-09 15:17:15,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2023-12-09 15:17:15,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:15,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2023-12-09 15:17:15,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 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-12-09 15:17:15,008 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 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-12-09 15:17:15,009 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 29 predicate places. [2023-12-09 15:17:15,010 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 250 transitions, 1499 flow [2023-12-09 15:17:15,010 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,010 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:15,011 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:15,011 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:17:15,011 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:15,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1168626892, now seen corresponding path program 4 times [2023-12-09 15:17:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:15,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731852611] [2023-12-09 15:17:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:15,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:15,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731852611] [2023-12-09 15:17:15,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731852611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:15,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:15,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:17:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003997624] [2023-12-09 15:17:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:15,228 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:17:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:17:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:17:15,230 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2023-12-09 15:17:15,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 250 transitions, 1499 flow. Second operand has 11 states, 11 states have (on average 78.9090909090909) internal successors, (868), 11 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:15,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2023-12-09 15:17:15,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:15,510 INFO L124 PetriNetUnfolderBase]: 132/589 cut-off events. [2023-12-09 15:17:15,510 INFO L125 PetriNetUnfolderBase]: For 938/986 co-relation queries the response was YES. [2023-12-09 15:17:15,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 589 events. 132/589 cut-off events. For 938/986 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3199 event pairs, 1 based on Foata normal form. 10/593 useless extension candidates. Maximal degree in co-relation 1442. Up to 186 conditions per place. [2023-12-09 15:17:15,513 INFO L140 encePairwiseOnDemand]: 97/113 looper letters, 82 selfloop transitions, 13 changer transitions 92/261 dead transitions. [2023-12-09 15:17:15,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 261 transitions, 1962 flow [2023-12-09 15:17:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:17:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:17:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1292 transitions. [2023-12-09 15:17:15,516 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7146017699115044 [2023-12-09 15:17:15,516 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1292 transitions. [2023-12-09 15:17:15,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1292 transitions. [2023-12-09 15:17:15,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:15,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1292 transitions. [2023-12-09 15:17:15,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 80.75) internal successors, (1292), 16 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,522 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,522 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 44 predicate places. [2023-12-09 15:17:15,523 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 261 transitions, 1962 flow [2023-12-09 15:17:15,523 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.9090909090909) internal successors, (868), 11 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,523 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:15,523 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:15,523 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:17:15,524 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:15,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1513161094, now seen corresponding path program 5 times [2023-12-09 15:17:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:15,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61719170] [2023-12-09 15:17:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61719170] [2023-12-09 15:17:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61719170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:17:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340060521] [2023-12-09 15:17:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:15,578 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:17:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:17:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:17:15,579 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 113 [2023-12-09 15:17:15,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 261 transitions, 1962 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:15,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 113 [2023-12-09 15:17:15,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:15,679 INFO L124 PetriNetUnfolderBase]: 133/595 cut-off events. [2023-12-09 15:17:15,679 INFO L125 PetriNetUnfolderBase]: For 1483/1529 co-relation queries the response was YES. [2023-12-09 15:17:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 595 events. 133/595 cut-off events. For 1483/1529 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3228 event pairs, 5 based on Foata normal form. 9/595 useless extension candidates. Maximal degree in co-relation 1392. Up to 189 conditions per place. [2023-12-09 15:17:15,682 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 53 selfloop transitions, 2 changer transitions 96/264 dead transitions. [2023-12-09 15:17:15,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 264 transitions, 2228 flow [2023-12-09 15:17:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:17:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:17:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-12-09 15:17:15,683 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8967551622418879 [2023-12-09 15:17:15,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-12-09 15:17:15,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-12-09 15:17:15,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:15,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-12-09 15:17:15,684 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-12-09 15:17:15,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,685 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 46 predicate places. [2023-12-09 15:17:15,686 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 264 transitions, 2228 flow [2023-12-09 15:17:15,686 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,686 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:15,686 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:15,686 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:17:15,686 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:15,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1558596574, now seen corresponding path program 6 times [2023-12-09 15:17:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694682762] [2023-12-09 15:17:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:15,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694682762] [2023-12-09 15:17:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694682762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:17:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303568695] [2023-12-09 15:17:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:15,956 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:17:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:17:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:17:15,958 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:15,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 264 transitions, 2228 flow. Second operand has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:15,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:15,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:15,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:16,109 INFO L124 PetriNetUnfolderBase]: 110/529 cut-off events. [2023-12-09 15:17:16,109 INFO L125 PetriNetUnfolderBase]: For 1938/2015 co-relation queries the response was YES. [2023-12-09 15:17:16,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 529 events. 110/529 cut-off events. For 1938/2015 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2746 event pairs, 4 based on Foata normal form. 19/541 useless extension candidates. Maximal degree in co-relation 1603. Up to 158 conditions per place. [2023-12-09 15:17:16,112 INFO L140 encePairwiseOnDemand]: 101/113 looper letters, 69 selfloop transitions, 11 changer transitions 113/265 dead transitions. [2023-12-09 15:17:16,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 265 transitions, 2623 flow [2023-12-09 15:17:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 765 transitions. [2023-12-09 15:17:16,114 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7522123893805309 [2023-12-09 15:17:16,114 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 765 transitions. [2023-12-09 15:17:16,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 765 transitions. [2023-12-09 15:17:16,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:16,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 765 transitions. [2023-12-09 15:17:16,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.0) internal successors, (765), 9 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,118 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,119 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 54 predicate places. [2023-12-09 15:17:16,119 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 265 transitions, 2623 flow [2023-12-09 15:17:16,120 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,120 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:16,120 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:16,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:17:16,120 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:16,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1215219388, now seen corresponding path program 7 times [2023-12-09 15:17:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:16,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556894069] [2023-12-09 15:17:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:16,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:16,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556894069] [2023-12-09 15:17:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556894069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:16,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:17:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135195828] [2023-12-09 15:17:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:16,169 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:17:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:16,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:17:16,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:17:16,171 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 113 [2023-12-09 15:17:16,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 265 transitions, 2623 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:16,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 113 [2023-12-09 15:17:16,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:16,265 INFO L124 PetriNetUnfolderBase]: 111/548 cut-off events. [2023-12-09 15:17:16,265 INFO L125 PetriNetUnfolderBase]: For 2654/2713 co-relation queries the response was YES. [2023-12-09 15:17:16,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2349 conditions, 548 events. 111/548 cut-off events. For 2654/2713 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2868 event pairs, 10 based on Foata normal form. 11/554 useless extension candidates. Maximal degree in co-relation 1566. Up to 157 conditions per place. [2023-12-09 15:17:16,268 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 39 selfloop transitions, 2 changer transitions 118/269 dead transitions. [2023-12-09 15:17:16,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 269 transitions, 2925 flow [2023-12-09 15:17:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:17:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:17:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-12-09 15:17:16,269 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8967551622418879 [2023-12-09 15:17:16,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-12-09 15:17:16,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-12-09 15:17:16,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:16,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-12-09 15:17:16,270 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-12-09 15:17:16,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,287 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 56 predicate places. [2023-12-09 15:17:16,287 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 269 transitions, 2925 flow [2023-12-09 15:17:16,287 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,287 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:16,287 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:16,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:17:16,288 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:16,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1239557814, now seen corresponding path program 8 times [2023-12-09 15:17:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933177090] [2023-12-09 15:17:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933177090] [2023-12-09 15:17:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933177090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:17:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95957906] [2023-12-09 15:17:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:16,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:17:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:17:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:17:16,620 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:16,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 269 transitions, 2925 flow. Second operand has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:16,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:16,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:16,784 INFO L124 PetriNetUnfolderBase]: 108/530 cut-off events. [2023-12-09 15:17:16,784 INFO L125 PetriNetUnfolderBase]: For 3402/3492 co-relation queries the response was YES. [2023-12-09 15:17:16,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 530 events. 108/530 cut-off events. For 3402/3492 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2787 event pairs, 6 based on Foata normal form. 21/546 useless extension candidates. Maximal degree in co-relation 1918. Up to 156 conditions per place. [2023-12-09 15:17:16,787 INFO L140 encePairwiseOnDemand]: 100/113 looper letters, 60 selfloop transitions, 18 changer transitions 124/274 dead transitions. [2023-12-09 15:17:16,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 274 transitions, 3365 flow [2023-12-09 15:17:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2023-12-09 15:17:16,789 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7453294001966568 [2023-12-09 15:17:16,790 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2023-12-09 15:17:16,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2023-12-09 15:17:16,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:16,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2023-12-09 15:17:16,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,794 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,796 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 64 predicate places. [2023-12-09 15:17:16,797 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 274 transitions, 3365 flow [2023-12-09 15:17:16,798 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:16,799 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:16,799 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:16,799 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:17:16,799 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:16,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash 666404256, now seen corresponding path program 9 times [2023-12-09 15:17:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032405598] [2023-12-09 15:17:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:17,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032405598] [2023-12-09 15:17:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032405598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:17,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:17:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619100795] [2023-12-09 15:17:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:17,116 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:17:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:17:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:17:17,118 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:17,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 274 transitions, 3365 flow. Second operand has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:17,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:17,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:17,247 INFO L124 PetriNetUnfolderBase]: 97/502 cut-off events. [2023-12-09 15:17:17,247 INFO L125 PetriNetUnfolderBase]: For 4113/4209 co-relation queries the response was YES. [2023-12-09 15:17:17,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 502 events. 97/502 cut-off events. For 4113/4209 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2615 event pairs, 8 based on Foata normal form. 15/511 useless extension candidates. Maximal degree in co-relation 2000. Up to 148 conditions per place. [2023-12-09 15:17:17,249 INFO L140 encePairwiseOnDemand]: 100/113 looper letters, 56 selfloop transitions, 11 changer transitions 133/272 dead transitions. [2023-12-09 15:17:17,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 272 transitions, 3725 flow [2023-12-09 15:17:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 755 transitions. [2023-12-09 15:17:17,252 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7423795476892822 [2023-12-09 15:17:17,252 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 755 transitions. [2023-12-09 15:17:17,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 755 transitions. [2023-12-09 15:17:17,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:17,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 755 transitions. [2023-12-09 15:17:17,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.88888888888889) internal successors, (755), 9 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,256 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,256 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 72 predicate places. [2023-12-09 15:17:17,256 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 272 transitions, 3725 flow [2023-12-09 15:17:17,257 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,257 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:17,257 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:17,257 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:17:17,258 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:17,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1972137404, now seen corresponding path program 10 times [2023-12-09 15:17:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:17,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431933511] [2023-12-09 15:17:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:17,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:17,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431933511] [2023-12-09 15:17:17,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431933511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:17,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:17:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322910596] [2023-12-09 15:17:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:17,597 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:17:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:17:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:17:17,599 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:17,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 272 transitions, 3725 flow. Second operand has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:17,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:17,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:17,745 INFO L124 PetriNetUnfolderBase]: 104/542 cut-off events. [2023-12-09 15:17:17,745 INFO L125 PetriNetUnfolderBase]: For 5461/5577 co-relation queries the response was YES. [2023-12-09 15:17:17,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 542 events. 104/542 cut-off events. For 5461/5577 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2908 event pairs, 10 based on Foata normal form. 13/549 useless extension candidates. Maximal degree in co-relation 2172. Up to 190 conditions per place. [2023-12-09 15:17:17,748 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 57 selfloop transitions, 7 changer transitions 149/285 dead transitions. [2023-12-09 15:17:17,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 285 transitions, 4383 flow [2023-12-09 15:17:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2023-12-09 15:17:17,750 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7453294001966568 [2023-12-09 15:17:17,751 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2023-12-09 15:17:17,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2023-12-09 15:17:17,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:17,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2023-12-09 15:17:17,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,754 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,754 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 80 predicate places. [2023-12-09 15:17:17,754 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 285 transitions, 4383 flow [2023-12-09 15:17:17,755 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,755 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:17,755 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:17,755 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:17:17,755 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:17,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1206335254, now seen corresponding path program 11 times [2023-12-09 15:17:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543816278] [2023-12-09 15:17:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:17,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:17,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543816278] [2023-12-09 15:17:17,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543816278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:17,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:17,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:17:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448672178] [2023-12-09 15:17:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:17,979 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:17:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:17:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:17:17,980 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:17,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 285 transitions, 4383 flow. Second operand has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:17,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:17,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:18,125 INFO L124 PetriNetUnfolderBase]: 101/545 cut-off events. [2023-12-09 15:17:18,126 INFO L125 PetriNetUnfolderBase]: For 6657/6794 co-relation queries the response was YES. [2023-12-09 15:17:18,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 545 events. 101/545 cut-off events. For 6657/6794 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2926 event pairs, 7 based on Foata normal form. 12/551 useless extension candidates. Maximal degree in co-relation 2310. Up to 187 conditions per place. [2023-12-09 15:17:18,129 INFO L140 encePairwiseOnDemand]: 101/113 looper letters, 48 selfloop transitions, 14 changer transitions 152/286 dead transitions. [2023-12-09 15:17:18,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 286 transitions, 4813 flow [2023-12-09 15:17:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 756 transitions. [2023-12-09 15:17:18,131 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7433628318584071 [2023-12-09 15:17:18,131 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 756 transitions. [2023-12-09 15:17:18,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 756 transitions. [2023-12-09 15:17:18,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:18,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 756 transitions. [2023-12-09 15:17:18,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,134 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,134 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 88 predicate places. [2023-12-09 15:17:18,134 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 286 transitions, 4813 flow [2023-12-09 15:17:18,135 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,135 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:18,135 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:18,135 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:17:18,135 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:17:18,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1423168824, now seen corresponding path program 12 times [2023-12-09 15:17:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536290572] [2023-12-09 15:17:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:17:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:18,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536290572] [2023-12-09 15:17:18,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536290572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:18,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:18,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:17:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175432191] [2023-12-09 15:17:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:18,434 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:17:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:17:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:17:18,435 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2023-12-09 15:17:18,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 286 transitions, 4813 flow. Second operand has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:18,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2023-12-09 15:17:18,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:18,567 INFO L124 PetriNetUnfolderBase]: 92/401 cut-off events. [2023-12-09 15:17:18,567 INFO L125 PetriNetUnfolderBase]: For 5992/6077 co-relation queries the response was YES. [2023-12-09 15:17:18,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 401 events. 92/401 cut-off events. For 5992/6077 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1890 event pairs, 6 based on Foata normal form. 8/407 useless extension candidates. Maximal degree in co-relation 2243. Up to 135 conditions per place. [2023-12-09 15:17:18,569 INFO L140 encePairwiseOnDemand]: 101/113 looper letters, 0 selfloop transitions, 0 changer transitions 226/226 dead transitions. [2023-12-09 15:17:18,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 226 transitions, 3992 flow [2023-12-09 15:17:18,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:17:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:17:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2023-12-09 15:17:18,571 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7394296951819076 [2023-12-09 15:17:18,571 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 752 transitions. [2023-12-09 15:17:18,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 752 transitions. [2023-12-09 15:17:18,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:18,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 752 transitions. [2023-12-09 15:17:18,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,574 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,574 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 88 predicate places. [2023-12-09 15:17:18,575 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 226 transitions, 3992 flow [2023-12-09 15:17:18,575 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.33333333333333) internal successors, (732), 9 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:17:18,579 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-bakery-2.wvr.c_BEv2_AllErrorsAtOnce [2023-12-09 15:17:18,602 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:17:18,602 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:17:18,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:17:18,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 15:17:18,603 INFO L457 BasicCegarLoop]: Path program histogram: [12] [2023-12-09 15:17:18,605 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:17:18,605 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:17:18,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:17:18 BasicIcfg [2023-12-09 15:17:18,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:17:18,609 INFO L158 Benchmark]: Toolchain (without parser) took 6627.30ms. Allocated memory was 262.1MB in the beginning and 465.6MB in the end (delta: 203.4MB). Free memory was 210.2MB in the beginning and 269.9MB in the end (delta: -59.8MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. [2023-12-09 15:17:18,610 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory was 165.0MB in the beginning and 164.8MB in the end (delta: 180.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:17:18,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.53ms. Allocated memory is still 262.1MB. Free memory was 210.2MB in the beginning and 198.5MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:17:18,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 262.1MB. Free memory was 198.5MB in the beginning and 196.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:17:18,610 INFO L158 Benchmark]: Boogie Preprocessor took 17.96ms. Allocated memory is still 262.1MB. Free memory was 196.5MB in the beginning and 195.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:17:18,610 INFO L158 Benchmark]: RCFGBuilder took 370.38ms. Allocated memory is still 262.1MB. Free memory was 195.1MB in the beginning and 223.1MB in the end (delta: -28.0MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. [2023-12-09 15:17:18,611 INFO L158 Benchmark]: TraceAbstraction took 5950.64ms. Allocated memory was 262.1MB in the beginning and 465.6MB in the end (delta: 203.4MB). Free memory was 222.6MB in the beginning and 269.9MB in the end (delta: -47.4MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. [2023-12-09 15:17:18,612 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.12ms. Allocated memory is still 215.0MB. Free memory was 165.0MB in the beginning and 164.8MB in the end (delta: 180.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.53ms. Allocated memory is still 262.1MB. Free memory was 210.2MB in the beginning and 198.5MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 262.1MB. Free memory was 198.5MB in the beginning and 196.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.96ms. Allocated memory is still 262.1MB. Free memory was 196.5MB in the beginning and 195.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 370.38ms. Allocated memory is still 262.1MB. Free memory was 195.1MB in the beginning and 223.1MB in the end (delta: -28.0MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5950.64ms. Allocated memory was 262.1MB in the beginning and 465.6MB in the end (delta: 203.4MB). Free memory was 222.6MB in the beginning and 269.9MB in the end (delta: -47.4MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 130]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 140 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 571 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 676 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1710 IncrementalHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 227 mSDtfsCounter, 1710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4813occurred in iteration=11, InterpolantAutomatonStates: 108, 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.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1164 ConstructedInterpolants, 0 QuantifiedInterpolants, 2480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-09 15:17:18,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...