/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/chl-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:10:10,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:10:10,678 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:10:10,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:10:10,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:10:10,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:10:10,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:10:10,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:10:10,696 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:10:10,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:10:10,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:10:10,696 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:10:10,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:10:10,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:10:10,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:10:10,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:10:10,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:10:10,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:10:10,698 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:10:10,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:10:10,698 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:10:10,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:10:10,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:10:10,699 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:10:10,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:10:10,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:10:10,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:10:10,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:10:10,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:10:10,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:10:10,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:10:10,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:10:10,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:10:10,701 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:10:10,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:10:10,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:10:10,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:10:10,859 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:10:10,859 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:10:10,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2023-12-09 15:10:11,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:10:12,032 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:10:12,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2023-12-09 15:10:12,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab46d138/c58b497f282e4b218146fc61c986f2b6/FLAG54f52d7d1 [2023-12-09 15:10:12,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab46d138/c58b497f282e4b218146fc61c986f2b6 [2023-12-09 15:10:12,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:10:12,053 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:10:12,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:10:12,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:10:12,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:10:12,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54466ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12, skipping insertion in model container [2023-12-09 15:10:12,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,088 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:10:12,206 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/chl-name-comparator-symm.wvr.c[3882,3895] [2023-12-09 15:10:12,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:10:12,220 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:10:12,238 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/chl-name-comparator-symm.wvr.c[3882,3895] [2023-12-09 15:10:12,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:10:12,252 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:10:12,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12 WrapperNode [2023-12-09 15:10:12,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:10:12,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:10:12,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:10:12,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:10:12,259 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:10:12" (1/1) ... [2023-12-09 15:10:12,265 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:10:12" (1/1) ... [2023-12-09 15:10:12,287 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 229 [2023-12-09 15:10:12,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:10:12,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:10:12,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:10:12,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:10:12,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:10:12,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:10:12,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:10:12,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:10:12,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (1/1) ... [2023-12-09 15:10:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:10:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:10:12,372 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:10:12,377 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:10:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:10:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:10:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:10:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:10:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:10:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:10:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:10:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:10:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:10:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:10:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:10:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:10:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:10:12,403 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:10:12,479 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:10:12,480 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:10:12,732 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:10:12,744 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:10:12,744 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:10:12,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:10:12 BoogieIcfgContainer [2023-12-09 15:10:12,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:10:12,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:10:12,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:10:12,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:10:12,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:10:12" (1/3) ... [2023-12-09 15:10:12,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657388e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:10:12, skipping insertion in model container [2023-12-09 15:10:12,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:12" (2/3) ... [2023-12-09 15:10:12,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657388e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:10:12, skipping insertion in model container [2023-12-09 15:10:12,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:10:12" (3/3) ... [2023-12-09 15:10:12,760 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2023-12-09 15:10:12,773 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:10:12,773 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:10:12,773 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:10:12,849 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:10:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 285 transitions, 584 flow [2023-12-09 15:10:12,962 INFO L124 PetriNetUnfolderBase]: 19/283 cut-off events. [2023-12-09 15:10:12,962 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:10:12,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 283 events. 19/283 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 509 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2023-12-09 15:10:12,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 285 transitions, 584 flow [2023-12-09 15:10:12,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 274 transitions, 560 flow [2023-12-09 15:10:12,990 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:10:12,995 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;@2dd630e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:10:12,995 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:10:13,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:10:13,053 INFO L124 PetriNetUnfolderBase]: 19/273 cut-off events. [2023-12-09 15:10:13,053 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:10:13,053 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:13,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,055 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:10:13,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2140585108, now seen corresponding path program 1 times [2023-12-09 15:10:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468240356] [2023-12-09 15:10:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:13,377 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:10:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468240356] [2023-12-09 15:10:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468240356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 15:10:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219056844] [2023-12-09 15:10:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:13,387 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 15:10:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 15:10:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 15:10:13,426 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 285 [2023-12-09 15:10:13,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 274 transitions, 560 flow. Second operand has 2 states, 2 states have (on average 269.0) internal successors, (538), 2 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:10:13,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:13,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 285 [2023-12-09 15:10:13,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:13,484 INFO L124 PetriNetUnfolderBase]: 5/260 cut-off events. [2023-12-09 15:10:13,484 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2023-12-09 15:10:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 260 events. 5/260 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 456 event pairs, 0 based on Foata normal form. 19/263 useless extension candidates. Maximal degree in co-relation 179. Up to 5 conditions per place. [2023-12-09 15:10:13,489 INFO L140 encePairwiseOnDemand]: 271/285 looper letters, 4 selfloop transitions, 0 changer transitions 3/260 dead transitions. [2023-12-09 15:10:13,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 260 transitions, 540 flow [2023-12-09 15:10:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 15:10:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 15:10:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 550 transitions. [2023-12-09 15:10:13,503 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2023-12-09 15:10:13,503 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 550 transitions. [2023-12-09 15:10:13,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 550 transitions. [2023-12-09 15:10:13,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:13,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 550 transitions. [2023-12-09 15:10:13,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 275.0) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 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:10:13,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 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:10:13,518 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 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:10:13,521 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 1 predicate places. [2023-12-09 15:10:13,521 INFO L500 AbstractCegarLoop]: Abstraction has has 263 places, 260 transitions, 540 flow [2023-12-09 15:10:13,522 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 269.0) internal successors, (538), 2 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:10:13,522 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:13,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,522 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:10:13,523 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:10:13,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1758078626, now seen corresponding path program 1 times [2023-12-09 15:10:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:13,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535808724] [2023-12-09 15:10:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:13,815 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:10:13,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535808724] [2023-12-09 15:10:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535808724] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:13,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:13,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:10:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935001126] [2023-12-09 15:10:13,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:13,817 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:10:13,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:13,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:10:13,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:10:13,820 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 285 [2023-12-09 15:10:13,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 260 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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:10:13,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:13,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 285 [2023-12-09 15:10:13,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:13,905 INFO L124 PetriNetUnfolderBase]: 5/267 cut-off events. [2023-12-09 15:10:13,905 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2023-12-09 15:10:13,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 267 events. 5/267 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 456 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 206. Up to 11 conditions per place. [2023-12-09 15:10:13,907 INFO L140 encePairwiseOnDemand]: 278/285 looper letters, 17 selfloop transitions, 6 changer transitions 3/264 dead transitions. [2023-12-09 15:10:13,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 264 transitions, 594 flow [2023-12-09 15:10:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:10:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:10:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1279 transitions. [2023-12-09 15:10:13,911 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8975438596491228 [2023-12-09 15:10:13,911 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1279 transitions. [2023-12-09 15:10:13,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1279 transitions. [2023-12-09 15:10:13,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:13,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1279 transitions. [2023-12-09 15:10:13,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 255.8) internal successors, (1279), 5 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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:10:13,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:13,917 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:13,917 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 5 predicate places. [2023-12-09 15:10:13,918 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 264 transitions, 594 flow [2023-12-09 15:10:13,919 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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:10:13,919 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:13,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:10:13,919 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:10:13,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 924215128, now seen corresponding path program 1 times [2023-12-09 15:10:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716973547] [2023-12-09 15:10:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716973547] [2023-12-09 15:10:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716973547] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:10:14,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399186149] [2023-12-09 15:10:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:14,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:10:14,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:10:14,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:10:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:10:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:14,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:10:14,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:10:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:14,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:10:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399186149] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:10:14,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:10:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-09 15:10:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373988825] [2023-12-09 15:10:14,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:10:14,491 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-09 15:10:14,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:14,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-09 15:10:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:10:14,496 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 285 [2023-12-09 15:10:14,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 264 transitions, 594 flow. Second operand has 14 states, 14 states have (on average 252.85714285714286) internal successors, (3540), 14 states have internal predecessors, (3540), 0 states have call successors, (0), 0 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:10:14,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:14,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 285 [2023-12-09 15:10:14,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:14,662 INFO L124 PetriNetUnfolderBase]: 5/277 cut-off events. [2023-12-09 15:10:14,662 INFO L125 PetriNetUnfolderBase]: For 47/52 co-relation queries the response was YES. [2023-12-09 15:10:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 277 events. 5/277 cut-off events. For 47/52 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 445 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 249. Up to 16 conditions per place. [2023-12-09 15:10:14,664 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 18 selfloop transitions, 13 changer transitions 3/271 dead transitions. [2023-12-09 15:10:14,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 271 transitions, 680 flow [2023-12-09 15:10:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:10:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:10:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2783 transitions. [2023-12-09 15:10:14,669 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2023-12-09 15:10:14,669 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2783 transitions. [2023-12-09 15:10:14,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2783 transitions. [2023-12-09 15:10:14,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:14,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2783 transitions. [2023-12-09 15:10:14,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 253.0) internal successors, (2783), 11 states have internal predecessors, (2783), 0 states have call successors, (0), 0 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:10:14,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:14,679 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:14,680 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 15 predicate places. [2023-12-09 15:10:14,680 INFO L500 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 680 flow [2023-12-09 15:10:14,682 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 252.85714285714286) internal successors, (3540), 14 states have internal predecessors, (3540), 0 states have call successors, (0), 0 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:10:14,683 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:14,683 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:10:14,888 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:10:14,889 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:10:14,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1722605392, now seen corresponding path program 2 times [2023-12-09 15:10:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549793421] [2023-12-09 15:10:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:15,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549793421] [2023-12-09 15:10:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549793421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:15,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:15,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:10:15,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515646814] [2023-12-09 15:10:15,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:15,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:10:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:10:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:10:15,330 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:15,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 680 flow. Second operand has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:15,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:15,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:15,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:16,071 INFO L124 PetriNetUnfolderBase]: 432/2526 cut-off events. [2023-12-09 15:10:16,071 INFO L125 PetriNetUnfolderBase]: For 962/962 co-relation queries the response was YES. [2023-12-09 15:10:16,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3777 conditions, 2526 events. 432/2526 cut-off events. For 962/962 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 20888 event pairs, 162 based on Foata normal form. 0/2284 useless extension candidates. Maximal degree in co-relation 3049. Up to 312 conditions per place. [2023-12-09 15:10:16,083 INFO L140 encePairwiseOnDemand]: 263/285 looper letters, 142 selfloop transitions, 20 changer transitions 20/391 dead transitions. [2023-12-09 15:10:16,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 391 transitions, 1392 flow [2023-12-09 15:10:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:10:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:10:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3511 transitions. [2023-12-09 15:10:16,089 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7699561403508772 [2023-12-09 15:10:16,089 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3511 transitions. [2023-12-09 15:10:16,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3511 transitions. [2023-12-09 15:10:16,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:16,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3511 transitions. [2023-12-09 15:10:16,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 219.4375) internal successors, (3511), 16 states have internal predecessors, (3511), 0 states have call successors, (0), 0 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:10:16,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:16,101 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:16,102 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 30 predicate places. [2023-12-09 15:10:16,102 INFO L500 AbstractCegarLoop]: Abstraction has has 292 places, 391 transitions, 1392 flow [2023-12-09 15:10:16,102 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:16,102 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:16,103 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,103 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:10:16,103 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:10:16,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2022922306, now seen corresponding path program 3 times [2023-12-09 15:10:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856176403] [2023-12-09 15:10:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856176403] [2023-12-09 15:10:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856176403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:16,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:16,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:10:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540612335] [2023-12-09 15:10:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:16,565 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:10:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:10:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:10:16,568 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:16,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 391 transitions, 1392 flow. Second operand has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:16,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:16,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:16,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:17,405 INFO L124 PetriNetUnfolderBase]: 901/5064 cut-off events. [2023-12-09 15:10:17,405 INFO L125 PetriNetUnfolderBase]: For 2570/2925 co-relation queries the response was YES. [2023-12-09 15:10:17,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8919 conditions, 5064 events. 901/5064 cut-off events. For 2570/2925 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 50039 event pairs, 203 based on Foata normal form. 37/4627 useless extension candidates. Maximal degree in co-relation 7475. Up to 852 conditions per place. [2023-12-09 15:10:17,427 INFO L140 encePairwiseOnDemand]: 259/285 looper letters, 266 selfloop transitions, 92 changer transitions 69/640 dead transitions. [2023-12-09 15:10:17,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 640 transitions, 3332 flow [2023-12-09 15:10:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:10:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:10:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3290 transitions. [2023-12-09 15:10:17,432 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7695906432748538 [2023-12-09 15:10:17,432 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3290 transitions. [2023-12-09 15:10:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3290 transitions. [2023-12-09 15:10:17,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:17,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3290 transitions. [2023-12-09 15:10:17,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 219.33333333333334) internal successors, (3290), 15 states have internal predecessors, (3290), 0 states have call successors, (0), 0 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:10:17,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:17,443 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:17,444 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 44 predicate places. [2023-12-09 15:10:17,444 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 640 transitions, 3332 flow [2023-12-09 15:10:17,444 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:17,444 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:17,445 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:17,445 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:10:17,445 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:10:17,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash -375177674, now seen corresponding path program 4 times [2023-12-09 15:10:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:17,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477368319] [2023-12-09 15:10:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477368319] [2023-12-09 15:10:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477368319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:10:17,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25192230] [2023-12-09 15:10:17,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:17,822 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:10:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:10:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:10:17,824 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:17,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 640 transitions, 3332 flow. Second operand has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:17,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:17,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:17,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:18,838 INFO L124 PetriNetUnfolderBase]: 1092/6017 cut-off events. [2023-12-09 15:10:18,838 INFO L125 PetriNetUnfolderBase]: For 5181/6522 co-relation queries the response was YES. [2023-12-09 15:10:18,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12802 conditions, 6017 events. 1092/6017 cut-off events. For 5181/6522 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 62700 event pairs, 209 based on Foata normal form. 136/5595 useless extension candidates. Maximal degree in co-relation 11777. Up to 1015 conditions per place. [2023-12-09 15:10:18,875 INFO L140 encePairwiseOnDemand]: 263/285 looper letters, 369 selfloop transitions, 89 changer transitions 152/828 dead transitions. [2023-12-09 15:10:18,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 828 transitions, 5798 flow [2023-12-09 15:10:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:10:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:10:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3292 transitions. [2023-12-09 15:10:18,881 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7700584795321638 [2023-12-09 15:10:18,881 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3292 transitions. [2023-12-09 15:10:18,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3292 transitions. [2023-12-09 15:10:18,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:18,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3292 transitions. [2023-12-09 15:10:18,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 219.46666666666667) internal successors, (3292), 15 states have internal predecessors, (3292), 0 states have call successors, (0), 0 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:10:18,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:18,895 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:18,896 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 58 predicate places. [2023-12-09 15:10:18,896 INFO L500 AbstractCegarLoop]: Abstraction has has 320 places, 828 transitions, 5798 flow [2023-12-09 15:10:18,897 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:18,897 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:18,897 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:18,897 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:10:18,897 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:10:18,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash -303444762, now seen corresponding path program 5 times [2023-12-09 15:10:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666702514] [2023-12-09 15:10:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666702514] [2023-12-09 15:10:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666702514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:10:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57698955] [2023-12-09 15:10:19,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:19,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:10:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:10:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:10:19,207 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:19,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 828 transitions, 5798 flow. Second operand has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:19,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:19,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:19,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:20,667 INFO L124 PetriNetUnfolderBase]: 1623/9393 cut-off events. [2023-12-09 15:10:20,667 INFO L125 PetriNetUnfolderBase]: For 10779/14461 co-relation queries the response was YES. [2023-12-09 15:10:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22425 conditions, 9393 events. 1623/9393 cut-off events. For 10779/14461 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 104748 event pairs, 255 based on Foata normal form. 100/8593 useless extension candidates. Maximal degree in co-relation 18602. Up to 1641 conditions per place. [2023-12-09 15:10:20,711 INFO L140 encePairwiseOnDemand]: 263/285 looper letters, 618 selfloop transitions, 162 changer transitions 218/1215 dead transitions. [2023-12-09 15:10:20,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 1215 transitions, 11157 flow [2023-12-09 15:10:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:10:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:10:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3290 transitions. [2023-12-09 15:10:20,716 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7695906432748538 [2023-12-09 15:10:20,716 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3290 transitions. [2023-12-09 15:10:20,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3290 transitions. [2023-12-09 15:10:20,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:20,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3290 transitions. [2023-12-09 15:10:20,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 219.33333333333334) internal successors, (3290), 15 states have internal predecessors, (3290), 0 states have call successors, (0), 0 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:10:20,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:20,726 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:20,726 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 72 predicate places. [2023-12-09 15:10:20,726 INFO L500 AbstractCegarLoop]: Abstraction has has 334 places, 1215 transitions, 11157 flow [2023-12-09 15:10:20,727 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:20,727 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:20,727 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,727 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:10:20,727 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:10:20,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash -129317896, now seen corresponding path program 6 times [2023-12-09 15:10:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710726744] [2023-12-09 15:10:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710726744] [2023-12-09 15:10:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710726744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:10:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423149107] [2023-12-09 15:10:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:21,011 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:10:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:10:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:10:21,013 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:21,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1215 transitions, 11157 flow. Second operand has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:21,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:21,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:21,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:22,752 INFO L124 PetriNetUnfolderBase]: 1682/9802 cut-off events. [2023-12-09 15:10:22,752 INFO L125 PetriNetUnfolderBase]: For 15894/20817 co-relation queries the response was YES. [2023-12-09 15:10:22,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26810 conditions, 9802 events. 1682/9802 cut-off events. For 15894/20817 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 110207 event pairs, 244 based on Foata normal form. 314/9185 useless extension candidates. Maximal degree in co-relation 24531. Up to 1762 conditions per place. [2023-12-09 15:10:22,877 INFO L140 encePairwiseOnDemand]: 263/285 looper letters, 758 selfloop transitions, 180 changer transitions 263/1418 dead transitions. [2023-12-09 15:10:22,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1418 transitions, 15823 flow [2023-12-09 15:10:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:10:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:10:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3509 transitions. [2023-12-09 15:10:22,884 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7695175438596491 [2023-12-09 15:10:22,884 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3509 transitions. [2023-12-09 15:10:22,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3509 transitions. [2023-12-09 15:10:22,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:22,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3509 transitions. [2023-12-09 15:10:22,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 219.3125) internal successors, (3509), 16 states have internal predecessors, (3509), 0 states have call successors, (0), 0 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:10:22,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:22,895 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:22,897 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 87 predicate places. [2023-12-09 15:10:22,898 INFO L500 AbstractCegarLoop]: Abstraction has has 349 places, 1418 transitions, 15823 flow [2023-12-09 15:10:22,898 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.5) internal successors, (2125), 10 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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:10:22,898 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:22,898 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,898 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:10:22,899 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:10:22,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1097479060, now seen corresponding path program 7 times [2023-12-09 15:10:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:22,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850148808] [2023-12-09 15:10:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850148808] [2023-12-09 15:10:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850148808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:10:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349606343] [2023-12-09 15:10:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:23,180 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:10:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:10:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:10:23,182 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:23,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1418 transitions, 15823 flow. Second operand has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:23,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:23,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:23,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:25,172 INFO L124 PetriNetUnfolderBase]: 1859/10522 cut-off events. [2023-12-09 15:10:25,172 INFO L125 PetriNetUnfolderBase]: For 24511/34415 co-relation queries the response was YES. [2023-12-09 15:10:25,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33206 conditions, 10522 events. 1859/10522 cut-off events. For 24511/34415 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 121110 event pairs, 291 based on Foata normal form. 281/9815 useless extension candidates. Maximal degree in co-relation 26911. Up to 1953 conditions per place. [2023-12-09 15:10:25,221 INFO L140 encePairwiseOnDemand]: 263/285 looper letters, 831 selfloop transitions, 231 changer transitions 342/1634 dead transitions. [2023-12-09 15:10:25,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1634 transitions, 21415 flow [2023-12-09 15:10:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:10:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:10:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3510 transitions. [2023-12-09 15:10:25,226 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7697368421052632 [2023-12-09 15:10:25,226 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3510 transitions. [2023-12-09 15:10:25,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3510 transitions. [2023-12-09 15:10:25,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:25,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3510 transitions. [2023-12-09 15:10:25,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 219.375) internal successors, (3510), 16 states have internal predecessors, (3510), 0 states have call successors, (0), 0 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:10:25,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:25,239 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:25,240 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 102 predicate places. [2023-12-09 15:10:25,240 INFO L500 AbstractCegarLoop]: Abstraction has has 364 places, 1634 transitions, 21415 flow [2023-12-09 15:10:25,241 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:25,241 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:25,241 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,241 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:10:25,242 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:10:25,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1232457750, now seen corresponding path program 8 times [2023-12-09 15:10:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:25,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122915672] [2023-12-09 15:10:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:25,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:25,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:25,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122915672] [2023-12-09 15:10:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122915672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:10:25,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122251304] [2023-12-09 15:10:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:25,519 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:10:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:10:25,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:10:25,521 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:25,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1634 transitions, 21415 flow. Second operand has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:25,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:25,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:25,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:27,975 INFO L124 PetriNetUnfolderBase]: 2299/13069 cut-off events. [2023-12-09 15:10:27,975 INFO L125 PetriNetUnfolderBase]: For 38830/51222 co-relation queries the response was YES. [2023-12-09 15:10:28,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44855 conditions, 13069 events. 2299/13069 cut-off events. For 38830/51222 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 158484 event pairs, 332 based on Foata normal form. 303/12154 useless extension candidates. Maximal degree in co-relation 36915. Up to 2393 conditions per place. [2023-12-09 15:10:28,063 INFO L140 encePairwiseOnDemand]: 260/285 looper letters, 1134 selfloop transitions, 164 changer transitions 461/1989 dead transitions. [2023-12-09 15:10:28,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1989 transitions, 30104 flow [2023-12-09 15:10:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:10:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:10:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3285 transitions. [2023-12-09 15:10:28,067 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7684210526315789 [2023-12-09 15:10:28,067 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3285 transitions. [2023-12-09 15:10:28,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3285 transitions. [2023-12-09 15:10:28,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:28,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3285 transitions. [2023-12-09 15:10:28,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 219.0) internal successors, (3285), 15 states have internal predecessors, (3285), 0 states have call successors, (0), 0 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:10:28,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:28,075 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:28,076 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 116 predicate places. [2023-12-09 15:10:28,076 INFO L500 AbstractCegarLoop]: Abstraction has has 378 places, 1989 transitions, 30104 flow [2023-12-09 15:10:28,076 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:28,076 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:28,077 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:28,077 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:10:28,077 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:10:28,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash -538785028, now seen corresponding path program 9 times [2023-12-09 15:10:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829995583] [2023-12-09 15:10:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:28,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829995583] [2023-12-09 15:10:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829995583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:10:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779429633] [2023-12-09 15:10:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:28,451 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:10:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:10:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:10:28,453 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:28,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1989 transitions, 30104 flow. Second operand has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:28,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:28,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:28,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:31,256 INFO L124 PetriNetUnfolderBase]: 2415/14391 cut-off events. [2023-12-09 15:10:31,257 INFO L125 PetriNetUnfolderBase]: For 53086/67645 co-relation queries the response was YES. [2023-12-09 15:10:31,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52669 conditions, 14391 events. 2415/14391 cut-off events. For 53086/67645 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 178814 event pairs, 313 based on Foata normal form. 410/13467 useless extension candidates. Maximal degree in co-relation 43535. Up to 2564 conditions per place. [2023-12-09 15:10:31,343 INFO L140 encePairwiseOnDemand]: 262/285 looper letters, 1160 selfloop transitions, 177 changer transitions 592/2154 dead transitions. [2023-12-09 15:10:31,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 2154 transitions, 36732 flow [2023-12-09 15:10:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:10:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:10:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3282 transitions. [2023-12-09 15:10:31,347 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.767719298245614 [2023-12-09 15:10:31,347 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3282 transitions. [2023-12-09 15:10:31,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3282 transitions. [2023-12-09 15:10:31,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:31,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3282 transitions. [2023-12-09 15:10:31,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 218.8) internal successors, (3282), 15 states have internal predecessors, (3282), 0 states have call successors, (0), 0 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:10:31,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:31,356 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:31,356 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 130 predicate places. [2023-12-09 15:10:31,356 INFO L500 AbstractCegarLoop]: Abstraction has has 392 places, 2154 transitions, 36732 flow [2023-12-09 15:10:31,357 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:31,357 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:31,357 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:31,357 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:10:31,357 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:10:31,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2006379708, now seen corresponding path program 10 times [2023-12-09 15:10:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115857432] [2023-12-09 15:10:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115857432] [2023-12-09 15:10:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115857432] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:10:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132602652] [2023-12-09 15:10:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:31,651 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:10:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:10:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:10:31,653 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:31,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 2154 transitions, 36732 flow. Second operand has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:31,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:31,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:31,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:34,849 INFO L124 PetriNetUnfolderBase]: 2457/14507 cut-off events. [2023-12-09 15:10:34,849 INFO L125 PetriNetUnfolderBase]: For 67752/84281 co-relation queries the response was YES. [2023-12-09 15:10:34,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58817 conditions, 14507 events. 2457/14507 cut-off events. For 67752/84281 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 180254 event pairs, 325 based on Foata normal form. 535/13684 useless extension candidates. Maximal degree in co-relation 48118. Up to 2652 conditions per place. [2023-12-09 15:10:34,933 INFO L140 encePairwiseOnDemand]: 263/285 looper letters, 1073 selfloop transitions, 304 changer transitions 673/2275 dead transitions. [2023-12-09 15:10:34,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 2275 transitions, 43208 flow [2023-12-09 15:10:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:10:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:10:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3508 transitions. [2023-12-09 15:10:34,937 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.769298245614035 [2023-12-09 15:10:34,937 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3508 transitions. [2023-12-09 15:10:34,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3508 transitions. [2023-12-09 15:10:34,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:34,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3508 transitions. [2023-12-09 15:10:34,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 219.25) internal successors, (3508), 16 states have internal predecessors, (3508), 0 states have call successors, (0), 0 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:10:34,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:34,946 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 285.0) internal successors, (4845), 17 states have internal predecessors, (4845), 0 states have call successors, (0), 0 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:10:34,947 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 145 predicate places. [2023-12-09 15:10:34,947 INFO L500 AbstractCegarLoop]: Abstraction has has 407 places, 2275 transitions, 43208 flow [2023-12-09 15:10:34,947 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:34,947 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:34,947 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:34,947 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 15:10:34,948 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:10:34,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1978211014, now seen corresponding path program 11 times [2023-12-09 15:10:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181399186] [2023-12-09 15:10:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181399186] [2023-12-09 15:10:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181399186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:35,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 15:10:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881265731] [2023-12-09 15:10:35,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:35,358 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 15:10:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 15:10:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:10:35,360 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 285 [2023-12-09 15:10:35,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 2275 transitions, 43208 flow. Second operand has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:35,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:35,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 285 [2023-12-09 15:10:35,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:38,702 INFO L124 PetriNetUnfolderBase]: 2733/16166 cut-off events. [2023-12-09 15:10:38,702 INFO L125 PetriNetUnfolderBase]: For 89574/112160 co-relation queries the response was YES. [2023-12-09 15:10:38,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71087 conditions, 16166 events. 2733/16166 cut-off events. For 89574/112160 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 206204 event pairs, 311 based on Foata normal form. 504/15237 useless extension candidates. Maximal degree in co-relation 58934. Up to 2798 conditions per place. [2023-12-09 15:10:38,810 INFO L140 encePairwiseOnDemand]: 259/285 looper letters, 1234 selfloop transitions, 356 changer transitions 808/2632 dead transitions. [2023-12-09 15:10:38,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 2632 transitions, 55288 flow [2023-12-09 15:10:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:10:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:10:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3291 transitions. [2023-12-09 15:10:38,814 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7698245614035087 [2023-12-09 15:10:38,814 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3291 transitions. [2023-12-09 15:10:38,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3291 transitions. [2023-12-09 15:10:38,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:38,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3291 transitions. [2023-12-09 15:10:38,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 219.4) internal successors, (3291), 15 states have internal predecessors, (3291), 0 states have call successors, (0), 0 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:10:38,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:38,823 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:10:38,824 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 159 predicate places. [2023-12-09 15:10:38,824 INFO L500 AbstractCegarLoop]: Abstraction has has 421 places, 2632 transitions, 55288 flow [2023-12-09 15:10:38,824 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.0909090909091) internal successors, (2333), 11 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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:10:38,824 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:38,824 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:38,825 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 15:10:38,825 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:10:38,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:38,825 INFO L85 PathProgramCache]: Analyzing trace with hash -300812105, now seen corresponding path program 1 times [2023-12-09 15:10:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:38,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511697125] [2023-12-09 15:10:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511697125] [2023-12-09 15:10:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511697125] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:39,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:10:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73981304] [2023-12-09 15:10:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:39,054 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:10:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:10:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:10:39,056 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:10:39,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 2632 transitions, 55288 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:10:39,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:39,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:10:39,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:48,095 INFO L124 PetriNetUnfolderBase]: 6906/33860 cut-off events. [2023-12-09 15:10:48,095 INFO L125 PetriNetUnfolderBase]: For 220972/236799 co-relation queries the response was YES. [2023-12-09 15:10:48,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142510 conditions, 33860 events. 6906/33860 cut-off events. For 220972/236799 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 469291 event pairs, 1133 based on Foata normal form. 113/30844 useless extension candidates. Maximal degree in co-relation 127659. Up to 5003 conditions per place. [2023-12-09 15:10:48,366 INFO L140 encePairwiseOnDemand]: 271/285 looper letters, 1100 selfloop transitions, 202 changer transitions 870/3194 dead transitions. [2023-12-09 15:10:48,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 3194 transitions, 67745 flow [2023-12-09 15:10:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:10:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:10:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2871 transitions. [2023-12-09 15:10:48,368 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7748987854251013 [2023-12-09 15:10:48,369 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2871 transitions. [2023-12-09 15:10:48,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2871 transitions. [2023-12-09 15:10:48,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:48,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2871 transitions. [2023-12-09 15:10:48,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 220.84615384615384) internal successors, (2871), 13 states have internal predecessors, (2871), 0 states have call successors, (0), 0 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:10:48,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 285.0) internal successors, (3990), 14 states have internal predecessors, (3990), 0 states have call successors, (0), 0 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:10:48,375 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 285.0) internal successors, (3990), 14 states have internal predecessors, (3990), 0 states have call successors, (0), 0 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:10:48,375 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 171 predicate places. [2023-12-09 15:10:48,375 INFO L500 AbstractCegarLoop]: Abstraction has has 433 places, 3194 transitions, 67745 flow [2023-12-09 15:10:48,376 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:10:48,376 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:48,376 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,376 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-09 15:10:48,376 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:10:48,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:48,377 INFO L85 PathProgramCache]: Analyzing trace with hash 468808341, now seen corresponding path program 2 times [2023-12-09 15:10:48,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:48,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952164882] [2023-12-09 15:10:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952164882] [2023-12-09 15:10:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952164882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:48,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:10:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291752225] [2023-12-09 15:10:48,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:48,527 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:10:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:10:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:10:48,528 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:10:48,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 3194 transitions, 67745 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:10:48,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:48,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:10:48,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:01,889 INFO L124 PetriNetUnfolderBase]: 8916/40892 cut-off events. [2023-12-09 15:11:01,890 INFO L125 PetriNetUnfolderBase]: For 324299/356302 co-relation queries the response was YES. [2023-12-09 15:11:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197623 conditions, 40892 events. 8916/40892 cut-off events. For 324299/356302 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 578961 event pairs, 1123 based on Foata normal form. 229/37412 useless extension candidates. Maximal degree in co-relation 177378. Up to 8990 conditions per place. [2023-12-09 15:11:02,235 INFO L140 encePairwiseOnDemand]: 267/285 looper letters, 1749 selfloop transitions, 184 changer transitions 944/3899 dead transitions. [2023-12-09 15:11:02,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 3899 transitions, 85031 flow [2023-12-09 15:11:02,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:11:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:11:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2225 transitions. [2023-12-09 15:11:02,251 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7807017543859649 [2023-12-09 15:11:02,251 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2225 transitions. [2023-12-09 15:11:02,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2225 transitions. [2023-12-09 15:11:02,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:02,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2225 transitions. [2023-12-09 15:11:02,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 222.5) internal successors, (2225), 10 states have internal predecessors, (2225), 0 states have call successors, (0), 0 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:11:02,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 285.0) internal successors, (3135), 11 states have internal predecessors, (3135), 0 states have call successors, (0), 0 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:11:02,256 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 285.0) internal successors, (3135), 11 states have internal predecessors, (3135), 0 states have call successors, (0), 0 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:11:02,256 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 180 predicate places. [2023-12-09 15:11:02,256 INFO L500 AbstractCegarLoop]: Abstraction has has 442 places, 3899 transitions, 85031 flow [2023-12-09 15:11:02,257 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:11:02,257 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:02,257 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:02,257 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-09 15:11:02,257 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:11:02,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -292626509, now seen corresponding path program 3 times [2023-12-09 15:11:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:02,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510743068] [2023-12-09 15:11:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:11:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510743068] [2023-12-09 15:11:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510743068] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:11:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081533218] [2023-12-09 15:11:02,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:11:02,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:02,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:11:02,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:11:02,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:11:02,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:11:02,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:11:02,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-09 15:11:02,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:11:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:11:02,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:11:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:11:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081533218] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:11:02,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:11:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 19 [2023-12-09 15:11:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378427608] [2023-12-09 15:11:02,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:11:02,874 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-09 15:11:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-09 15:11:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:11:02,876 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 285 [2023-12-09 15:11:02,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 3899 transitions, 85031 flow. Second operand has 19 states, 19 states have (on average 185.26315789473685) internal successors, (3520), 19 states have internal predecessors, (3520), 0 states have call successors, (0), 0 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:11:02,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:02,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 285 [2023-12-09 15:11:02,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:22,259 INFO L124 PetriNetUnfolderBase]: 10509/45995 cut-off events. [2023-12-09 15:11:22,284 INFO L125 PetriNetUnfolderBase]: For 419967/461224 co-relation queries the response was YES. [2023-12-09 15:11:22,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246132 conditions, 45995 events. 10509/45995 cut-off events. For 419967/461224 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 659372 event pairs, 769 based on Foata normal form. 672/42538 useless extension candidates. Maximal degree in co-relation 222661. Up to 10740 conditions per place. [2023-12-09 15:11:22,805 INFO L140 encePairwiseOnDemand]: 252/285 looper letters, 2631 selfloop transitions, 747 changer transitions 1175/5467 dead transitions. [2023-12-09 15:11:22,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 5467 transitions, 125904 flow [2023-12-09 15:11:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-09 15:11:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-12-09 15:11:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5554 transitions. [2023-12-09 15:11:22,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6719903206291591 [2023-12-09 15:11:22,809 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5554 transitions. [2023-12-09 15:11:22,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5554 transitions. [2023-12-09 15:11:22,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:22,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5554 transitions. [2023-12-09 15:11:22,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 191.51724137931035) internal successors, (5554), 29 states have internal predecessors, (5554), 0 states have call successors, (0), 0 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:11:22,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 285.0) internal successors, (8550), 30 states have internal predecessors, (8550), 0 states have call successors, (0), 0 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:11:22,821 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 285.0) internal successors, (8550), 30 states have internal predecessors, (8550), 0 states have call successors, (0), 0 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:11:22,822 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 208 predicate places. [2023-12-09 15:11:22,822 INFO L500 AbstractCegarLoop]: Abstraction has has 470 places, 5467 transitions, 125904 flow [2023-12-09 15:11:22,823 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 185.26315789473685) internal successors, (3520), 19 states have internal predecessors, (3520), 0 states have call successors, (0), 0 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:11:22,823 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:22,823 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:22,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:11:23,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-09 15:11:23,027 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:11:23,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 446242271, now seen corresponding path program 4 times [2023-12-09 15:11:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:23,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171452473] [2023-12-09 15:11:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:11:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171452473] [2023-12-09 15:11:23,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171452473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:23,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:11:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717195654] [2023-12-09 15:11:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:23,217 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:11:23,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:11:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:11:23,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:11:23,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 5467 transitions, 125904 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:11:23,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:23,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:11:23,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:54,738 INFO L124 PetriNetUnfolderBase]: 11992/52421 cut-off events. [2023-12-09 15:11:54,738 INFO L125 PetriNetUnfolderBase]: For 528658/577115 co-relation queries the response was YES. [2023-12-09 15:11:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306800 conditions, 52421 events. 11992/52421 cut-off events. For 528658/577115 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 764337 event pairs, 899 based on Foata normal form. 798/48593 useless extension candidates. Maximal degree in co-relation 279780. Up to 11187 conditions per place. [2023-12-09 15:11:55,452 INFO L140 encePairwiseOnDemand]: 255/285 looper letters, 3414 selfloop transitions, 439 changer transitions 1268/6167 dead transitions. [2023-12-09 15:11:55,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 6167 transitions, 151708 flow [2023-12-09 15:11:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:11:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:11:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3312 transitions. [2023-12-09 15:11:55,455 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7747368421052632 [2023-12-09 15:11:55,455 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3312 transitions. [2023-12-09 15:11:55,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3312 transitions. [2023-12-09 15:11:55,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:55,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3312 transitions. [2023-12-09 15:11:55,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 220.8) internal successors, (3312), 15 states have internal predecessors, (3312), 0 states have call successors, (0), 0 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:11:55,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:11:55,461 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 285.0) internal successors, (4560), 16 states have internal predecessors, (4560), 0 states have call successors, (0), 0 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:11:55,461 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 222 predicate places. [2023-12-09 15:11:55,461 INFO L500 AbstractCegarLoop]: Abstraction has has 484 places, 6167 transitions, 151708 flow [2023-12-09 15:11:55,462 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:11:55,462 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:55,462 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:55,462 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-09 15:11:55,462 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:11:55,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1140857169, now seen corresponding path program 5 times [2023-12-09 15:11:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470438740] [2023-12-09 15:11:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:11:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470438740] [2023-12-09 15:11:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470438740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:11:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592581236] [2023-12-09 15:11:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:55,636 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:11:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:11:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:11:55,637 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:11:55,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 6167 transitions, 151708 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:11:55,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:55,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:11:55,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:12:34,702 INFO L124 PetriNetUnfolderBase]: 12144/53188 cut-off events. [2023-12-09 15:12:34,702 INFO L125 PetriNetUnfolderBase]: For 583981/637692 co-relation queries the response was YES. [2023-12-09 15:12:34,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332940 conditions, 53188 events. 12144/53188 cut-off events. For 583981/637692 co-relation queries the response was YES. Maximal size of possible extension queue 1410. Compared 776898 event pairs, 779 based on Foata normal form. 661/49108 useless extension candidates. Maximal degree in co-relation 322940. Up to 11285 conditions per place. [2023-12-09 15:12:35,536 INFO L140 encePairwiseOnDemand]: 257/285 looper letters, 3548 selfloop transitions, 445 changer transitions 1287/6326 dead transitions. [2023-12-09 15:12:35,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 6326 transitions, 164674 flow [2023-12-09 15:12:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:12:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:12:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2483 transitions. [2023-12-09 15:12:35,539 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7920255183413079 [2023-12-09 15:12:35,539 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2483 transitions. [2023-12-09 15:12:35,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2483 transitions. [2023-12-09 15:12:35,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:12:35,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2483 transitions. [2023-12-09 15:12:35,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 225.72727272727272) internal successors, (2483), 11 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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:12:35,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:35,543 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:35,543 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 232 predicate places. [2023-12-09 15:12:35,544 INFO L500 AbstractCegarLoop]: Abstraction has has 494 places, 6326 transitions, 164674 flow [2023-12-09 15:12:35,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:12:35,544 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:12:35,544 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:35,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-09 15:12:35,544 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:12:35,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:12:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1228500537, now seen corresponding path program 6 times [2023-12-09 15:12:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:12:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374812527] [2023-12-09 15:12:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:12:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:12:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:12:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:12:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:12:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374812527] [2023-12-09 15:12:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374812527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:12:35,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:12:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:12:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844791393] [2023-12-09 15:12:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:12:35,711 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:12:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:12:35,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:12:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:12:35,712 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:12:35,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 6326 transitions, 164674 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:12:35,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:12:35,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:12:35,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:23,018 INFO L124 PetriNetUnfolderBase]: 13118/56276 cut-off events. [2023-12-09 15:13:23,018 INFO L125 PetriNetUnfolderBase]: For 704248/775759 co-relation queries the response was YES. [2023-12-09 15:13:23,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380076 conditions, 56276 events. 13118/56276 cut-off events. For 704248/775759 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 825689 event pairs, 909 based on Foata normal form. 1082/52395 useless extension candidates. Maximal degree in co-relation 349392. Up to 12339 conditions per place. [2023-12-09 15:13:23,727 INFO L140 encePairwiseOnDemand]: 270/285 looper letters, 3881 selfloop transitions, 654 changer transitions 1387/6968 dead transitions. [2023-12-09 15:13:23,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 6968 transitions, 190959 flow [2023-12-09 15:13:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:13:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:13:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2074 transitions. [2023-12-09 15:13:23,730 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8085769980506823 [2023-12-09 15:13:23,730 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2074 transitions. [2023-12-09 15:13:23,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2074 transitions. [2023-12-09 15:13:23,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:23,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2074 transitions. [2023-12-09 15:13:23,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 230.44444444444446) internal successors, (2074), 9 states have internal predecessors, (2074), 0 states have call successors, (0), 0 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:13:23,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 0 states have call successors, (0), 0 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:13:23,734 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 0 states have call successors, (0), 0 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:13:23,734 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 240 predicate places. [2023-12-09 15:13:23,734 INFO L500 AbstractCegarLoop]: Abstraction has has 502 places, 6968 transitions, 190959 flow [2023-12-09 15:13:23,734 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:13:23,734 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:23,734 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,734 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-09 15:13:23,734 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:13:23,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1135011383, now seen corresponding path program 7 times [2023-12-09 15:13:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097757936] [2023-12-09 15:13:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:13:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097757936] [2023-12-09 15:13:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097757936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:23,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:23,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:23,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756700242] [2023-12-09 15:13:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:23,899 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:23,900 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:13:23,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 6968 transitions, 190959 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:13:23,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:23,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:13:23,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:14:16,120 INFO L124 PetriNetUnfolderBase]: 14593/61946 cut-off events. [2023-12-09 15:14:16,120 INFO L125 PetriNetUnfolderBase]: For 853176/936193 co-relation queries the response was YES. [2023-12-09 15:14:16,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449388 conditions, 61946 events. 14593/61946 cut-off events. For 853176/936193 co-relation queries the response was YES. Maximal size of possible extension queue 1585. Compared 918535 event pairs, 989 based on Foata normal form. 909/57402 useless extension candidates. Maximal degree in co-relation 414671. Up to 16407 conditions per place. [2023-12-09 15:14:16,933 INFO L140 encePairwiseOnDemand]: 262/285 looper letters, 4569 selfloop transitions, 640 changer transitions 1448/7703 dead transitions. [2023-12-09 15:14:16,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 7703 transitions, 224446 flow [2023-12-09 15:14:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:14:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:14:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2611 transitions. [2023-12-09 15:14:16,935 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7634502923976608 [2023-12-09 15:14:16,935 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2611 transitions. [2023-12-09 15:14:16,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2611 transitions. [2023-12-09 15:14:16,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:14:16,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2611 transitions. [2023-12-09 15:14:16,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 217.58333333333334) internal successors, (2611), 12 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:14:16,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 285.0) internal successors, (3705), 13 states have internal predecessors, (3705), 0 states have call successors, (0), 0 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:14:16,940 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 285.0) internal successors, (3705), 13 states have internal predecessors, (3705), 0 states have call successors, (0), 0 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:14:16,940 INFO L308 CegarLoopForPetriNet]: 262 programPoint places, 251 predicate places. [2023-12-09 15:14:16,940 INFO L500 AbstractCegarLoop]: Abstraction has has 513 places, 7703 transitions, 224446 flow [2023-12-09 15:14:16,941 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:14:16,941 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:14:16,941 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:16,941 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-09 15:14:16,941 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:14:16,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:14:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1247016725, now seen corresponding path program 8 times [2023-12-09 15:14:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:14:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220561717] [2023-12-09 15:14:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:14:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:14:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:14:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:14:17,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:14:17,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220561717] [2023-12-09 15:14:17,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220561717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:14:17,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:14:17,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:14:17,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266184253] [2023-12-09 15:14:17,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:14:17,119 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:14:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:14:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:14:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:14:17,120 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 285 [2023-12-09 15:14:17,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 7703 transitions, 224446 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:14:17,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:14:17,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 285 [2023-12-09 15:14:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:14:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:14:23,140 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:14:23,140 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-09 15:14:23,140 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 202/285 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 43950 conditions, 5190 events (1270/5189 cut-off events. For 107250/127746 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 70575 event pairs, 92 based on Foata normal form. 233/5676 useless extension candidates. Maximal degree in co-relation 43397. Up to 1999 conditions per place.). [2023-12-09 15:14:23,142 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:14:23,142 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:14:23,142 INFO L457 BasicCegarLoop]: Path program histogram: [11, 8, 1, 1] [2023-12-09 15:14:23,144 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:14:23,144 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:14:23,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:14:23 BasicIcfg [2023-12-09 15:14:23,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:14:23,148 INFO L158 Benchmark]: Toolchain (without parser) took 251094.77ms. Allocated memory was 290.5MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 240.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-12-09 15:14:23,148 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:14:23,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.07ms. Allocated memory is still 290.5MB. Free memory was 240.3MB in the beginning and 227.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:14:23,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.54ms. Allocated memory is still 290.5MB. Free memory was 227.6MB in the beginning and 225.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:14:23,149 INFO L158 Benchmark]: Boogie Preprocessor took 29.07ms. Allocated memory is still 290.5MB. Free memory was 225.1MB in the beginning and 223.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:14:23,149 INFO L158 Benchmark]: RCFGBuilder took 427.79ms. Allocated memory is still 290.5MB. Free memory was 223.6MB in the beginning and 201.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-09 15:14:23,149 INFO L158 Benchmark]: TraceAbstraction took 250399.89ms. Allocated memory was 290.5MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 200.0MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-12-09 15:14:23,150 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.11ms. Allocated memory is still 206.6MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.07ms. Allocated memory is still 290.5MB. Free memory was 240.3MB in the beginning and 227.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.54ms. Allocated memory is still 290.5MB. Free memory was 227.6MB in the beginning and 225.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.07ms. Allocated memory is still 290.5MB. Free memory was 225.1MB in the beginning and 223.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 427.79ms. Allocated memory is still 290.5MB. Free memory was 223.6MB in the beginning and 201.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 250399.89ms. Allocated memory was 290.5MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 200.0MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 202/285 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 43950 conditions, 5190 events (1270/5189 cut-off events. For 107250/127746 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 70575 event pairs, 92 based on Foata normal form. 233/5676 useless extension candidates. Maximal degree in co-relation 43397. Up to 1999 conditions per place.). - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 202/285 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 43950 conditions, 5190 events (1270/5189 cut-off events. For 107250/127746 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 70575 event pairs, 92 based on Foata normal form. 233/5676 useless extension candidates. Maximal degree in co-relation 43397. Up to 1999 conditions per place.). - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 202/285 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 43950 conditions, 5190 events (1270/5189 cut-off events. For 107250/127746 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 70575 event pairs, 92 based on Foata normal form. 233/5676 useless extension candidates. Maximal degree in co-relation 43397. Up to 1999 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 401 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 250.3s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 243.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2900 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2900 mSDsluCounter, 7342 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5660 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9345 IncrementalHoareTripleChecker+Invalid, 9651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 1682 mSDtfsCounter, 9345 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1110 GetRequests, 781 SyntacticMatches, 1 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224446occurred in iteration=20, InterpolantAutomatonStates: 271, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 4250 NumberOfCodeBlocks, 4234 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4590 ConstructedInterpolants, 0 QuantifiedInterpolants, 11610 SizeOfPredicates, 16 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 554/563 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown