/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:19:45,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:19:45,655 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:19:45,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:19:45,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:19:45,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:19:45,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:19:45,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:19:45,688 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:19:45,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:19:45,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:19:45,693 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:19:45,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:19:45,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:19:45,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:19:45,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:19:45,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:19:45,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:19:45,695 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:19:45,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:19:45,695 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:19:45,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:19:45,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:19:45,697 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:19:45,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:19:45,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:19:45,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:19:45,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:19:45,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:19:45,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:19:45,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:19:45,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:19:45,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:19:45,699 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:19:45,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:19:45,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:19:45,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:19:45,963 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:19:45,964 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:19:45,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2023-12-09 15:19:47,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:19:47,326 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:19:47,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2023-12-09 15:19:47,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785a71148/540077be856243e898aab5999360ff0a/FLAGfb4364848 [2023-12-09 15:19:47,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785a71148/540077be856243e898aab5999360ff0a [2023-12-09 15:19:47,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:19:47,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:19:47,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:19:47,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:19:47,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:19:47,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@817e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47, skipping insertion in model container [2023-12-09 15:19:47,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,378 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:19:47,534 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[3128,3141] [2023-12-09 15:19:47,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:19:47,546 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:19:47,579 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c[3128,3141] [2023-12-09 15:19:47,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:19:47,586 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:19:47,586 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:19:47,592 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:19:47,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47 WrapperNode [2023-12-09 15:19:47,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:19:47,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:19:47,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:19:47,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:19:47,598 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:19:47" (1/1) ... [2023-12-09 15:19:47,604 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:19:47" (1/1) ... [2023-12-09 15:19:47,630 INFO L138 Inliner]: procedures = 22, calls = 55, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 167 [2023-12-09 15:19:47,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:19:47,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:19:47,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:19:47,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:19:47,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:19:47,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:19:47,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:19:47,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:19:47,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (1/1) ... [2023-12-09 15:19:47,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:19:47,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:47,680 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:19:47,689 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:19:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:19:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:19:47,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:19:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:19:47,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:19:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:19:47,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:19:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:19:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:19:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:19:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:19:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:19:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:19:47,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:19:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:19:47,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:19:47,720 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:19:47,801 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:19:47,803 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:19:48,021 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:19:48,074 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:19:48,075 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-09 15:19:48,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:19:48 BoogieIcfgContainer [2023-12-09 15:19:48,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:19:48,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:19:48,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:19:48,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:19:48,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:19:47" (1/3) ... [2023-12-09 15:19:48,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129c3dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:19:48, skipping insertion in model container [2023-12-09 15:19:48,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:19:47" (2/3) ... [2023-12-09 15:19:48,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129c3dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:19:48, skipping insertion in model container [2023-12-09 15:19:48,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:19:48" (3/3) ... [2023-12-09 15:19:48,092 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2023-12-09 15:19:48,104 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:19:48,104 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:19:48,104 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:19:48,165 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:19:48,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 271 flow [2023-12-09 15:19:48,284 INFO L124 PetriNetUnfolderBase]: 2/122 cut-off events. [2023-12-09 15:19:48,284 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:19:48,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-12-09 15:19:48,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 271 flow [2023-12-09 15:19:48,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 240 flow [2023-12-09 15:19:48,311 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:19:48,316 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;@6f286232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:19:48,316 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:19:48,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:19:48,346 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-12-09 15:19:48,346 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:19:48,346 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:48,347 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] [2023-12-09 15:19:48,347 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:48,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash -973297418, now seen corresponding path program 1 times [2023-12-09 15:19:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021970503] [2023-12-09 15:19:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:49,676 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:19:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021970503] [2023-12-09 15:19:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021970503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:19:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731438315] [2023-12-09 15:19:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:49,687 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:19:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:19:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:19:49,721 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 125 [2023-12-09 15:19:49,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:19:49,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:49,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 125 [2023-12-09 15:19:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:50,200 INFO L124 PetriNetUnfolderBase]: 397/999 cut-off events. [2023-12-09 15:19:50,201 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2023-12-09 15:19:50,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 999 events. 397/999 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5815 event pairs, 252 based on Foata normal form. 3/969 useless extension candidates. Maximal degree in co-relation 1396. Up to 313 conditions per place. [2023-12-09 15:19:50,215 INFO L140 encePairwiseOnDemand]: 109/125 looper letters, 51 selfloop transitions, 11 changer transitions 13/147 dead transitions. [2023-12-09 15:19:50,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 147 transitions, 483 flow [2023-12-09 15:19:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:19:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:19:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1014 transitions. [2023-12-09 15:19:50,237 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7374545454545455 [2023-12-09 15:19:50,237 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1014 transitions. [2023-12-09 15:19:50,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1014 transitions. [2023-12-09 15:19:50,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:50,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1014 transitions. [2023-12-09 15:19:50,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 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:19:50,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:50,257 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:50,260 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2023-12-09 15:19:50,260 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 147 transitions, 483 flow [2023-12-09 15:19:50,261 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:19:50,262 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:50,262 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] [2023-12-09 15:19:50,262 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:19:50,263 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:50,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -294482106, now seen corresponding path program 2 times [2023-12-09 15:19:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357027035] [2023-12-09 15:19:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:50,564 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:19:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357027035] [2023-12-09 15:19:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357027035] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:19:50,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33251212] [2023-12-09 15:19:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:50,569 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:50,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:19:50,573 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 125 [2023-12-09 15:19:50,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 147 transitions, 483 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:19:50,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:50,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 125 [2023-12-09 15:19:50,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:50,867 INFO L124 PetriNetUnfolderBase]: 510/1287 cut-off events. [2023-12-09 15:19:50,867 INFO L125 PetriNetUnfolderBase]: For 763/907 co-relation queries the response was YES. [2023-12-09 15:19:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 1287 events. 510/1287 cut-off events. For 763/907 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8085 event pairs, 94 based on Foata normal form. 46/1313 useless extension candidates. Maximal degree in co-relation 2818. Up to 446 conditions per place. [2023-12-09 15:19:50,877 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 85 selfloop transitions, 43 changer transitions 36/243 dead transitions. [2023-12-09 15:19:50,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 243 transitions, 1264 flow [2023-12-09 15:19:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:19:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:19:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 861 transitions. [2023-12-09 15:19:50,880 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7653333333333333 [2023-12-09 15:19:50,881 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 861 transitions. [2023-12-09 15:19:50,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 861 transitions. [2023-12-09 15:19:50,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:50,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 861 transitions. [2023-12-09 15:19:50,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 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:19:50,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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:19:50,886 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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:19:50,886 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2023-12-09 15:19:50,887 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 243 transitions, 1264 flow [2023-12-09 15:19:50,888 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:19:50,888 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:50,888 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] [2023-12-09 15:19:50,888 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:19:50,888 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:50,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1287790208, now seen corresponding path program 3 times [2023-12-09 15:19:50,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:50,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120548488] [2023-12-09 15:19:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:51,110 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:19:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120548488] [2023-12-09 15:19:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120548488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:19:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303484209] [2023-12-09 15:19:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:51,113 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:51,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:19:51,120 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 125 [2023-12-09 15:19:51,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 243 transitions, 1264 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:19:51,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:51,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 125 [2023-12-09 15:19:51,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:51,442 INFO L124 PetriNetUnfolderBase]: 524/1325 cut-off events. [2023-12-09 15:19:51,443 INFO L125 PetriNetUnfolderBase]: For 1648/1904 co-relation queries the response was YES. [2023-12-09 15:19:51,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 1325 events. 524/1325 cut-off events. For 1648/1904 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8396 event pairs, 98 based on Foata normal form. 58/1359 useless extension candidates. Maximal degree in co-relation 2868. Up to 463 conditions per place. [2023-12-09 15:19:51,453 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 88 selfloop transitions, 50 changer transitions 37/254 dead transitions. [2023-12-09 15:19:51,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 254 transitions, 1674 flow [2023-12-09 15:19:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:19:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:19:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 857 transitions. [2023-12-09 15:19:51,455 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7617777777777778 [2023-12-09 15:19:51,455 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 857 transitions. [2023-12-09 15:19:51,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 857 transitions. [2023-12-09 15:19:51,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:51,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 857 transitions. [2023-12-09 15:19:51,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.22222222222223) internal successors, (857), 9 states have internal predecessors, (857), 0 states have call successors, (0), 0 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:19:51,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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:19:51,460 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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:19:51,461 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places. [2023-12-09 15:19:51,461 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 254 transitions, 1674 flow [2023-12-09 15:19:51,462 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:19:51,462 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:51,462 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] [2023-12-09 15:19:51,462 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:19:51,462 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:51,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2070032084, now seen corresponding path program 4 times [2023-12-09 15:19:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175291394] [2023-12-09 15:19:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:51,896 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:19:51,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:51,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175291394] [2023-12-09 15:19:51,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175291394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:51,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:51,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 15:19:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674361593] [2023-12-09 15:19:51,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:51,897 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:19:51,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:19:51,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:19:51,900 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 125 [2023-12-09 15:19:51,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 254 transitions, 1674 flow. Second operand has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:19:51,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:51,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 125 [2023-12-09 15:19:51,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:52,306 INFO L124 PetriNetUnfolderBase]: 605/1596 cut-off events. [2023-12-09 15:19:52,306 INFO L125 PetriNetUnfolderBase]: For 2577/3479 co-relation queries the response was YES. [2023-12-09 15:19:52,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 1596 events. 605/1596 cut-off events. For 2577/3479 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11130 event pairs, 80 based on Foata normal form. 32/1602 useless extension candidates. Maximal degree in co-relation 5348. Up to 695 conditions per place. [2023-12-09 15:19:52,318 INFO L140 encePairwiseOnDemand]: 112/125 looper letters, 138 selfloop transitions, 9 changer transitions 122/341 dead transitions. [2023-12-09 15:19:52,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 341 transitions, 2952 flow [2023-12-09 15:19:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:19:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:19:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1096 transitions. [2023-12-09 15:19:52,322 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7306666666666667 [2023-12-09 15:19:52,322 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1096 transitions. [2023-12-09 15:19:52,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1096 transitions. [2023-12-09 15:19:52,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:52,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1096 transitions. [2023-12-09 15:19:52,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.33333333333333) internal successors, (1096), 12 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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:19:52,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 125.0) internal successors, (1625), 13 states have internal predecessors, (1625), 0 states have call successors, (0), 0 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:19:52,330 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 125.0) internal successors, (1625), 13 states have internal predecessors, (1625), 0 states have call successors, (0), 0 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:19:52,331 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2023-12-09 15:19:52,331 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 341 transitions, 2952 flow [2023-12-09 15:19:52,332 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:19:52,332 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:52,332 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] [2023-12-09 15:19:52,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:19:52,332 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:52,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1029029730, now seen corresponding path program 5 times [2023-12-09 15:19:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914261966] [2023-12-09 15:19:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:52,519 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:19:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914261966] [2023-12-09 15:19:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914261966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:19:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291579923] [2023-12-09 15:19:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:52,521 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:19:52,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:19:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:19:52,523 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 125 [2023-12-09 15:19:52,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 341 transitions, 2952 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:19:52,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:52,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 125 [2023-12-09 15:19:52,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:52,892 INFO L124 PetriNetUnfolderBase]: 598/1752 cut-off events. [2023-12-09 15:19:52,892 INFO L125 PetriNetUnfolderBase]: For 4925/6601 co-relation queries the response was YES. [2023-12-09 15:19:52,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7739 conditions, 1752 events. 598/1752 cut-off events. For 4925/6601 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13915 event pairs, 87 based on Foata normal form. 86/1807 useless extension candidates. Maximal degree in co-relation 6670. Up to 728 conditions per place. [2023-12-09 15:19:52,904 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 106 selfloop transitions, 41 changer transitions 203/431 dead transitions. [2023-12-09 15:19:52,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 431 transitions, 4611 flow [2023-12-09 15:19:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:19:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:19:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 769 transitions. [2023-12-09 15:19:52,907 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.769 [2023-12-09 15:19:52,907 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 769 transitions. [2023-12-09 15:19:52,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 769 transitions. [2023-12-09 15:19:52,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:52,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 769 transitions. [2023-12-09 15:19:52,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 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:19:52,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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:19:52,912 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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:19:52,914 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places. [2023-12-09 15:19:52,914 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 431 transitions, 4611 flow [2023-12-09 15:19:52,915 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:19:52,915 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:52,915 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] [2023-12-09 15:19:52,915 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:19:52,915 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:52,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1225970048, now seen corresponding path program 6 times [2023-12-09 15:19:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875417684] [2023-12-09 15:19:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:52,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:53,068 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:19:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:53,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875417684] [2023-12-09 15:19:53,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875417684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:53,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:53,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:19:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070964999] [2023-12-09 15:19:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:53,069 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:19:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:53,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:19:53,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:19:53,071 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 125 [2023-12-09 15:19:53,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 431 transitions, 4611 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:19:53,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:53,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 125 [2023-12-09 15:19:53,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:53,382 INFO L124 PetriNetUnfolderBase]: 354/1226 cut-off events. [2023-12-09 15:19:53,382 INFO L125 PetriNetUnfolderBase]: For 5375/6877 co-relation queries the response was YES. [2023-12-09 15:19:53,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5975 conditions, 1226 events. 354/1226 cut-off events. For 5375/6877 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9007 event pairs, 56 based on Foata normal form. 83/1281 useless extension candidates. Maximal degree in co-relation 3291. Up to 428 conditions per place. [2023-12-09 15:19:53,389 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 68 selfloop transitions, 26 changer transitions 201/371 dead transitions. [2023-12-09 15:19:53,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 371 transitions, 4448 flow [2023-12-09 15:19:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:19:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:19:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 769 transitions. [2023-12-09 15:19:53,391 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.769 [2023-12-09 15:19:53,391 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 769 transitions. [2023-12-09 15:19:53,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 769 transitions. [2023-12-09 15:19:53,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:53,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 769 transitions. [2023-12-09 15:19:53,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 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:19:53,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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:19:53,396 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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:19:53,398 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2023-12-09 15:19:53,398 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 371 transitions, 4448 flow [2023-12-09 15:19:53,399 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:19:53,399 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:53,399 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] [2023-12-09 15:19:53,399 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:19:53,399 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:53,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 526531340, now seen corresponding path program 7 times [2023-12-09 15:19:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664821512] [2023-12-09 15:19:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:53,640 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:19:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664821512] [2023-12-09 15:19:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664821512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:53,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:19:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625314683] [2023-12-09 15:19:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:53,645 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:19:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:53,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:19:53,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:19:53,647 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 125 [2023-12-09 15:19:53,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 371 transitions, 4448 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 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:19:53,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:53,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 125 [2023-12-09 15:19:53,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:54,020 INFO L124 PetriNetUnfolderBase]: 351/1287 cut-off events. [2023-12-09 15:19:54,020 INFO L125 PetriNetUnfolderBase]: For 6312/7607 co-relation queries the response was YES. [2023-12-09 15:19:54,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 1287 events. 351/1287 cut-off events. For 6312/7607 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9885 event pairs, 48 based on Foata normal form. 52/1309 useless extension candidates. Maximal degree in co-relation 3878. Up to 504 conditions per place. [2023-12-09 15:19:54,029 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 82 selfloop transitions, 25 changer transitions 254/427 dead transitions. [2023-12-09 15:19:54,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 427 transitions, 5762 flow [2023-12-09 15:19:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:19:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:19:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 802 transitions. [2023-12-09 15:19:54,031 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7128888888888889 [2023-12-09 15:19:54,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 802 transitions. [2023-12-09 15:19:54,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 802 transitions. [2023-12-09 15:19:54,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:54,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 802 transitions. [2023-12-09 15:19:54,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 0 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:19:54,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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:19:54,036 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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:19:54,037 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 59 predicate places. [2023-12-09 15:19:54,037 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 427 transitions, 5762 flow [2023-12-09 15:19:54,038 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 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:19:54,038 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:54,038 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] [2023-12-09 15:19:54,038 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:19:54,038 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:54,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash -499122834, now seen corresponding path program 8 times [2023-12-09 15:19:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004231258] [2023-12-09 15:19:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:54,285 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:19:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004231258] [2023-12-09 15:19:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004231258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:19:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362655919] [2023-12-09 15:19:54,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:54,286 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:19:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:19:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:19:54,288 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 125 [2023-12-09 15:19:54,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 427 transitions, 5762 flow. Second operand has 9 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:54,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:54,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 125 [2023-12-09 15:19:54,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:54,707 INFO L124 PetriNetUnfolderBase]: 354/1298 cut-off events. [2023-12-09 15:19:54,708 INFO L125 PetriNetUnfolderBase]: For 7530/9297 co-relation queries the response was YES. [2023-12-09 15:19:54,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8139 conditions, 1298 events. 354/1298 cut-off events. For 7530/9297 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10075 event pairs, 57 based on Foata normal form. 58/1322 useless extension candidates. Maximal degree in co-relation 4460. Up to 507 conditions per place. [2023-12-09 15:19:54,717 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 77 selfloop transitions, 22 changer transitions 274/439 dead transitions. [2023-12-09 15:19:54,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 439 transitions, 6658 flow [2023-12-09 15:19:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:19:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:19:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 975 transitions. [2023-12-09 15:19:54,719 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-12-09 15:19:54,719 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 975 transitions. [2023-12-09 15:19:54,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 975 transitions. [2023-12-09 15:19:54,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:54,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 975 transitions. [2023-12-09 15:19:54,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.63636363636364) internal successors, (975), 11 states have internal predecessors, (975), 0 states have call successors, (0), 0 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:19:54,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:54,725 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:54,725 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 69 predicate places. [2023-12-09 15:19:54,725 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 439 transitions, 6658 flow [2023-12-09 15:19:54,726 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:54,726 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:54,726 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] [2023-12-09 15:19:54,726 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:19:54,726 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:54,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash -427607406, now seen corresponding path program 9 times [2023-12-09 15:19:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749078809] [2023-12-09 15:19:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:54,980 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:19:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749078809] [2023-12-09 15:19:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749078809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:54,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:19:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609088885] [2023-12-09 15:19:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:54,981 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:19:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:19:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:19:54,983 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 125 [2023-12-09 15:19:54,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 439 transitions, 6658 flow. Second operand has 9 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:54,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:54,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 125 [2023-12-09 15:19:54,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:55,411 INFO L124 PetriNetUnfolderBase]: 308/1176 cut-off events. [2023-12-09 15:19:55,411 INFO L125 PetriNetUnfolderBase]: For 8169/9762 co-relation queries the response was YES. [2023-12-09 15:19:55,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 1176 events. 308/1176 cut-off events. For 8169/9762 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9040 event pairs, 54 based on Foata normal form. 58/1201 useless extension candidates. Maximal degree in co-relation 4352. Up to 479 conditions per place. [2023-12-09 15:19:55,419 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 42 selfloop transitions, 9 changer transitions 305/422 dead transitions. [2023-12-09 15:19:55,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 422 transitions, 7044 flow [2023-12-09 15:19:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:19:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:19:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 972 transitions. [2023-12-09 15:19:55,422 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7069090909090909 [2023-12-09 15:19:55,422 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 972 transitions. [2023-12-09 15:19:55,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 972 transitions. [2023-12-09 15:19:55,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:55,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 972 transitions. [2023-12-09 15:19:55,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.36363636363636) internal successors, (972), 11 states have internal predecessors, (972), 0 states have call successors, (0), 0 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:19:55,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:55,427 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:55,428 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 79 predicate places. [2023-12-09 15:19:55,428 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 422 transitions, 7044 flow [2023-12-09 15:19:55,428 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:55,428 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:55,428 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] [2023-12-09 15:19:55,429 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:19:55,429 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:55,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -796496478, now seen corresponding path program 10 times [2023-12-09 15:19:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842230213] [2023-12-09 15:19:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:55,664 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:19:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:55,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842230213] [2023-12-09 15:19:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842230213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:55,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:19:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414198051] [2023-12-09 15:19:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:55,670 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:19:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:19:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:19:55,672 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 125 [2023-12-09 15:19:55,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 422 transitions, 7044 flow. Second operand has 9 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:55,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:55,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 125 [2023-12-09 15:19:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:56,162 INFO L124 PetriNetUnfolderBase]: 270/1033 cut-off events. [2023-12-09 15:19:56,162 INFO L125 PetriNetUnfolderBase]: For 8767/11609 co-relation queries the response was YES. [2023-12-09 15:19:56,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 1033 events. 270/1033 cut-off events. For 8767/11609 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7938 event pairs, 45 based on Foata normal form. 101/1105 useless extension candidates. Maximal degree in co-relation 4356. Up to 446 conditions per place. [2023-12-09 15:19:56,167 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 0 selfloop transitions, 0 changer transitions 413/413 dead transitions. [2023-12-09 15:19:56,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 413 transitions, 7548 flow [2023-12-09 15:19:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:19:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:19:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 973 transitions. [2023-12-09 15:19:56,171 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7076363636363636 [2023-12-09 15:19:56,171 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 973 transitions. [2023-12-09 15:19:56,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 973 transitions. [2023-12-09 15:19:56,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:56,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 973 transitions. [2023-12-09 15:19:56,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 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:19:56,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:56,178 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 125.0) internal successors, (1500), 12 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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:19:56,179 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, 85 predicate places. [2023-12-09 15:19:56,179 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 413 transitions, 7548 flow [2023-12-09 15:19:56,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.55555555555556) internal successors, (752), 9 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:19:56,188 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-3.wvr.c_BEv2_AllErrorsAtOnce [2023-12-09 15:19:56,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:19:56,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:19:56,237 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:19:56,238 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:19:56,238 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:19:56,238 INFO L457 BasicCegarLoop]: Path program histogram: [10] [2023-12-09 15:19:56,241 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:19:56,241 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:19:56,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:19:56 BasicIcfg [2023-12-09 15:19:56,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:19:56,246 INFO L158 Benchmark]: Toolchain (without parser) took 8898.97ms. Allocated memory was 206.6MB in the beginning and 511.7MB in the end (delta: 305.1MB). Free memory was 155.8MB in the beginning and 416.9MB in the end (delta: -261.1MB). Peak memory consumption was 242.6MB. Max. memory is 8.0GB. [2023-12-09 15:19:56,246 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 206.6MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:19:56,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.15ms. Allocated memory is still 206.6MB. Free memory was 155.4MB in the beginning and 143.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:19:56,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 206.6MB. Free memory was 143.9MB in the beginning and 142.0MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:19:56,247 INFO L158 Benchmark]: Boogie Preprocessor took 20.81ms. Allocated memory is still 206.6MB. Free memory was 141.8MB in the beginning and 140.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:19:56,247 INFO L158 Benchmark]: RCFGBuilder took 423.49ms. Allocated memory is still 206.6MB. Free memory was 140.3MB in the beginning and 119.6MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-09 15:19:56,248 INFO L158 Benchmark]: TraceAbstraction took 8167.80ms. Allocated memory was 206.6MB in the beginning and 511.7MB in the end (delta: 305.1MB). Free memory was 119.0MB in the beginning and 416.9MB in the end (delta: -297.9MB). Peak memory consumption was 205.9MB. Max. memory is 8.0GB. [2023-12-09 15:19:56,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 206.6MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.15ms. Allocated memory is still 206.6MB. Free memory was 155.4MB in the beginning and 143.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 206.6MB. Free memory was 143.9MB in the beginning and 142.0MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.81ms. Allocated memory is still 206.6MB. Free memory was 141.8MB in the beginning and 140.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 423.49ms. Allocated memory is still 206.6MB. Free memory was 140.3MB in the beginning and 119.6MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8167.80ms. Allocated memory was 206.6MB in the beginning and 511.7MB in the end (delta: 305.1MB). Free memory was 119.0MB in the beginning and 416.9MB in the end (delta: -297.9MB). Peak memory consumption was 205.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 564 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2235 IncrementalHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 241 mSDtfsCounter, 2235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7548occurred in iteration=10, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1060 ConstructedInterpolants, 0 QuantifiedInterpolants, 4104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-09 15:19:56,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...