/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 -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:25:26,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:25:26,927 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-SemanticLbe.epf [2023-11-17 11:25:26,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:25:26,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:25:26,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:25:26,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:25:26,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:25:26,959 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:25:26,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:25:26,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:25:26,960 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:25:26,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:25:26,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:25:26,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:25:26,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:25:26,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:25:26,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:25:26,962 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:25:26,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:25:26,962 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:25:26,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:25:26,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:25:26,966 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:25:26,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:25:26,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:25:26,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:25:26,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:25:26,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:25:26,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:25:26,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:25:26,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:25:26,969 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:25:27,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:25:27,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:25:27,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:25:27,219 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:25:27,219 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:25:27,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-11-17 11:25:28,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:25:28,813 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:25:28,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-11-17 11:25:28,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d8e167a/0948e93bf4354ef3b65a9fd437615a79/FLAG5b0358a6c [2023-11-17 11:25:28,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d8e167a/0948e93bf4354ef3b65a9fd437615a79 [2023-11-17 11:25:28,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:25:28,849 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:25:28,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:25:28,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:25:28,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:25:28,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:28" (1/1) ... [2023-11-17 11:25:28,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb685c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:28, skipping insertion in model container [2023-11-17 11:25:28,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:28" (1/1) ... [2023-11-17 11:25:28,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:25:29,091 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i[944,957] [2023-11-17 11:25:29,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:25:29,339 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:25:29,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i[944,957] [2023-11-17 11:25:29,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:25:29,420 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:25:29,420 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:25:29,427 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:25:29,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29 WrapperNode [2023-11-17 11:25:29,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:25:29,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:25:29,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:25:29,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:25:29,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,482 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-17 11:25:29,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:25:29,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:25:29,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:25:29,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:25:29,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:25:29,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:25:29,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:25:29,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:25:29,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (1/1) ... [2023-11-17 11:25:29,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:25:29,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:25:29,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:25:29,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:25:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:25:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:25:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:25:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:25:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:25:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:25:29,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:25:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:25:29,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:25:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:25:29,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:25:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:25:29,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:25:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:25:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:25:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:25:29,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:25:29,608 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:25:29,784 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:25:29,786 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:25:30,156 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:25:30,345 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:25:30,345 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:25:30,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:30 BoogieIcfgContainer [2023-11-17 11:25:30,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:25:30,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:25:30,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:25:30,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:25:30,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:25:28" (1/3) ... [2023-11-17 11:25:30,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a71be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:30, skipping insertion in model container [2023-11-17 11:25:30,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:29" (2/3) ... [2023-11-17 11:25:30,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a71be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:30, skipping insertion in model container [2023-11-17 11:25:30,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:30" (3/3) ... [2023-11-17 11:25:30,354 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-11-17 11:25:30,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:25:30,371 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:25:30,371 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:25:30,448 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:25:30,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 50 transitions, 116 flow [2023-11-17 11:25:30,526 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2023-11-17 11:25:30,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:30,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 2/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-17 11:25:30,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 50 transitions, 116 flow [2023-11-17 11:25:30,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 46 transitions, 104 flow [2023-11-17 11:25:30,541 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:25:30,554 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2023-11-17 11:25:30,558 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2023-11-17 11:25:30,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2023-11-17 11:25:30,576 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2023-11-17 11:25:30,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:30,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 2/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-17 11:25:30,578 INFO L119 LiptonReduction]: Number of co-enabled transitions 1298 [2023-11-17 11:25:32,163 INFO L134 LiptonReduction]: Checked pairs total: 4264 [2023-11-17 11:25:32,164 INFO L136 LiptonReduction]: Total number of compositions: 24 [2023-11-17 11:25:32,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:25:32,183 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68245c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:25:32,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:25:32,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:25:32,187 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 11:25:32,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:32,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:32,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:25:32,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:32,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash 379415329, now seen corresponding path program 1 times [2023-11-17 11:25:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294650506] [2023-11-17 11:25:32,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294650506] [2023-11-17 11:25:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294650506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531982375] [2023-11-17 11:25:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:32,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:32,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:32,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 74 [2023-11-17 11:25:32,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:32,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:32,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 74 [2023-11-17 11:25:32,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:33,617 INFO L124 PetriNetUnfolderBase]: 3927/5593 cut-off events. [2023-11-17 11:25:33,618 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-17 11:25:33,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 5593 events. 3927/5593 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29650 event pairs, 1069 based on Foata normal form. 0/5292 useless extension candidates. Maximal degree in co-relation 11133. Up to 4291 conditions per place. [2023-11-17 11:25:33,663 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-17 11:25:33,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 192 flow [2023-11-17 11:25:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-17 11:25:33,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2023-11-17 11:25:33,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-17 11:25:33,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-17 11:25:33,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:33,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-17 11:25:33,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:33,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:33,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:33,690 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 115 transitions. [2023-11-17 11:25:33,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 192 flow [2023-11-17 11:25:33,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:25:33,697 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-17 11:25:33,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-17 11:25:33,702 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-17 11:25:33,702 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-17 11:25:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:33,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:33,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:33,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:25:33,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:33,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1059487941, now seen corresponding path program 1 times [2023-11-17 11:25:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197736635] [2023-11-17 11:25:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197736635] [2023-11-17 11:25:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197736635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:34,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329776762] [2023-11-17 11:25:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:34,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 74 [2023-11-17 11:25:34,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:34,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:34,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 74 [2023-11-17 11:25:34,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:35,865 INFO L124 PetriNetUnfolderBase]: 9929/13390 cut-off events. [2023-11-17 11:25:35,866 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2023-11-17 11:25:35,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27786 conditions, 13390 events. 9929/13390 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 61829 event pairs, 2989 based on Foata normal form. 350/13740 useless extension candidates. Maximal degree in co-relation 27776. Up to 8796 conditions per place. [2023-11-17 11:25:35,947 INFO L140 encePairwiseOnDemand]: 62/74 looper letters, 45 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-11-17 11:25:35,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 240 flow [2023-11-17 11:25:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2023-11-17 11:25:35,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391891891891892 [2023-11-17 11:25:35,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 130 transitions. [2023-11-17 11:25:35,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 130 transitions. [2023-11-17 11:25:35,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:35,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 130 transitions. [2023-11-17 11:25:35,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:35,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:35,956 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:35,956 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 4 states and 130 transitions. [2023-11-17 11:25:35,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 240 flow [2023-11-17 11:25:35,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:35,959 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 148 flow [2023-11-17 11:25:35,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-11-17 11:25:35,960 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-11-17 11:25:35,961 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 148 flow [2023-11-17 11:25:35,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:35,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:35,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:35,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:25:35,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:35,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -258901868, now seen corresponding path program 1 times [2023-11-17 11:25:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768238612] [2023-11-17 11:25:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:36,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768238612] [2023-11-17 11:25:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768238612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896758635] [2023-11-17 11:25:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:36,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:36,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:25:36,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:36,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:36,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:25:36,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:37,788 INFO L124 PetriNetUnfolderBase]: 7304/10261 cut-off events. [2023-11-17 11:25:37,788 INFO L125 PetriNetUnfolderBase]: For 3569/3724 co-relation queries the response was YES. [2023-11-17 11:25:37,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27547 conditions, 10261 events. 7304/10261 cut-off events. For 3569/3724 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 56771 event pairs, 1799 based on Foata normal form. 73/9833 useless extension candidates. Maximal degree in co-relation 27534. Up to 8338 conditions per place. [2023-11-17 11:25:37,851 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 47 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-11-17 11:25:37,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 322 flow [2023-11-17 11:25:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-17 11:25:37,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 11:25:37,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-17 11:25:37,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-17 11:25:37,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:37,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-17 11:25:37,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:37,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:37,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:37,860 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 148 flow. Second operand 3 states and 111 transitions. [2023-11-17 11:25:37,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 322 flow [2023-11-17 11:25:37,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:37,870 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 178 flow [2023-11-17 11:25:37,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-17 11:25:37,871 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-17 11:25:37,872 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 178 flow [2023-11-17 11:25:37,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:37,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:37,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:37,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:25:37,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:37,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash 564002112, now seen corresponding path program 1 times [2023-11-17 11:25:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020856422] [2023-11-17 11:25:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020856422] [2023-11-17 11:25:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020856422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126791313] [2023-11-17 11:25:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:38,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:38,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:25:38,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:38,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:38,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:25:38,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:39,699 INFO L124 PetriNetUnfolderBase]: 7800/10957 cut-off events. [2023-11-17 11:25:39,699 INFO L125 PetriNetUnfolderBase]: For 6431/6695 co-relation queries the response was YES. [2023-11-17 11:25:39,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31064 conditions, 10957 events. 7800/10957 cut-off events. For 6431/6695 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 60483 event pairs, 1819 based on Foata normal form. 165/10607 useless extension candidates. Maximal degree in co-relation 31049. Up to 8417 conditions per place. [2023-11-17 11:25:39,763 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 59 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2023-11-17 11:25:39,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 446 flow [2023-11-17 11:25:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2023-11-17 11:25:39,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2023-11-17 11:25:39,765 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 149 transitions. [2023-11-17 11:25:39,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 149 transitions. [2023-11-17 11:25:39,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:39,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 149 transitions. [2023-11-17 11:25:39,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:39,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:39,767 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:39,768 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 178 flow. Second operand 4 states and 149 transitions. [2023-11-17 11:25:39,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 446 flow [2023-11-17 11:25:39,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:39,775 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 255 flow [2023-11-17 11:25:39,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-11-17 11:25:39,777 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-11-17 11:25:39,778 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 255 flow [2023-11-17 11:25:39,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:39,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:39,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:39,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:25:39,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:39,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash -152550757, now seen corresponding path program 1 times [2023-11-17 11:25:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674776877] [2023-11-17 11:25:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674776877] [2023-11-17 11:25:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674776877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271744488] [2023-11-17 11:25:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:40,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:25:40,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:40,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:40,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:25:40,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:41,452 INFO L124 PetriNetUnfolderBase]: 7982/11205 cut-off events. [2023-11-17 11:25:41,452 INFO L125 PetriNetUnfolderBase]: For 12683/12998 co-relation queries the response was YES. [2023-11-17 11:25:41,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35734 conditions, 11205 events. 7982/11205 cut-off events. For 12683/12998 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 62046 event pairs, 1307 based on Foata normal form. 116/10810 useless extension candidates. Maximal degree in co-relation 35717. Up to 8034 conditions per place. [2023-11-17 11:25:41,513 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 65 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2023-11-17 11:25:41,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 591 flow [2023-11-17 11:25:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2023-11-17 11:25:41,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2023-11-17 11:25:41,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 150 transitions. [2023-11-17 11:25:41,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 150 transitions. [2023-11-17 11:25:41,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:41,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 150 transitions. [2023-11-17 11:25:41,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:41,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:41,517 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:41,517 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 255 flow. Second operand 4 states and 150 transitions. [2023-11-17 11:25:41,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 591 flow [2023-11-17 11:25:41,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 88 transitions, 576 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:41,524 INFO L231 Difference]: Finished difference. Result has 50 places, 57 transitions, 363 flow [2023-11-17 11:25:41,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=50, PETRI_TRANSITIONS=57} [2023-11-17 11:25:41,525 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-11-17 11:25:41,525 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 57 transitions, 363 flow [2023-11-17 11:25:41,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:41,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:41,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:41,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:25:41,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:41,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -168339367, now seen corresponding path program 2 times [2023-11-17 11:25:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899923985] [2023-11-17 11:25:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899923985] [2023-11-17 11:25:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899923985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:42,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691081002] [2023-11-17 11:25:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:42,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:42,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 74 [2023-11-17 11:25:42,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:42,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:42,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 74 [2023-11-17 11:25:42,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:43,644 INFO L124 PetriNetUnfolderBase]: 12990/17527 cut-off events. [2023-11-17 11:25:43,644 INFO L125 PetriNetUnfolderBase]: For 21850/21850 co-relation queries the response was YES. [2023-11-17 11:25:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59744 conditions, 17527 events. 12990/17527 cut-off events. For 21850/21850 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 86844 event pairs, 1743 based on Foata normal form. 134/17661 useless extension candidates. Maximal degree in co-relation 59726. Up to 12015 conditions per place. [2023-11-17 11:25:43,766 INFO L140 encePairwiseOnDemand]: 60/74 looper letters, 95 selfloop transitions, 55 changer transitions 0/150 dead transitions. [2023-11-17 11:25:43,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 150 transitions, 1108 flow [2023-11-17 11:25:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2023-11-17 11:25:43,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2023-11-17 11:25:43,768 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 215 transitions. [2023-11-17 11:25:43,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 215 transitions. [2023-11-17 11:25:43,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:43,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 215 transitions. [2023-11-17 11:25:43,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:43,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:43,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:43,771 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 363 flow. Second operand 6 states and 215 transitions. [2023-11-17 11:25:43,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 150 transitions, 1108 flow [2023-11-17 11:25:43,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 150 transitions, 1085 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:43,793 INFO L231 Difference]: Finished difference. Result has 59 places, 93 transitions, 859 flow [2023-11-17 11:25:43,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=59, PETRI_TRANSITIONS=93} [2023-11-17 11:25:43,795 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-11-17 11:25:43,795 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 93 transitions, 859 flow [2023-11-17 11:25:43,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:43,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:43,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:43,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:25:43,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:43,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:43,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1550347707, now seen corresponding path program 1 times [2023-11-17 11:25:43,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:43,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957062474] [2023-11-17 11:25:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957062474] [2023-11-17 11:25:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957062474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:44,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259510419] [2023-11-17 11:25:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:44,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:44,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:44,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:25:44,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 93 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:44,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:44,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:25:44,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:46,349 INFO L124 PetriNetUnfolderBase]: 12761/17901 cut-off events. [2023-11-17 11:25:46,349 INFO L125 PetriNetUnfolderBase]: For 67241/68022 co-relation queries the response was YES. [2023-11-17 11:25:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81505 conditions, 17901 events. 12761/17901 cut-off events. For 67241/68022 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 103161 event pairs, 1754 based on Foata normal form. 416/17557 useless extension candidates. Maximal degree in co-relation 81481. Up to 10828 conditions per place. [2023-11-17 11:25:46,493 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 98 selfloop transitions, 40 changer transitions 0/156 dead transitions. [2023-11-17 11:25:46,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 156 transitions, 1562 flow [2023-11-17 11:25:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-17 11:25:46,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2023-11-17 11:25:46,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-17 11:25:46,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-17 11:25:46,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:46,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-17 11:25:46,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:46,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:46,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:46,497 INFO L175 Difference]: Start difference. First operand has 59 places, 93 transitions, 859 flow. Second operand 5 states and 190 transitions. [2023-11-17 11:25:46,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 156 transitions, 1562 flow [2023-11-17 11:25:46,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 156 transitions, 1518 flow, removed 22 selfloop flow, removed 0 redundant places. [2023-11-17 11:25:46,626 INFO L231 Difference]: Finished difference. Result has 65 places, 112 transitions, 1196 flow [2023-11-17 11:25:46,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1196, PETRI_PLACES=65, PETRI_TRANSITIONS=112} [2023-11-17 11:25:46,626 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-11-17 11:25:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 112 transitions, 1196 flow [2023-11-17 11:25:46,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:46,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:46,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:46,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:25:46,627 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:46,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -358091290, now seen corresponding path program 1 times [2023-11-17 11:25:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642358492] [2023-11-17 11:25:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642358492] [2023-11-17 11:25:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642358492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:47,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:47,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:47,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050829115] [2023-11-17 11:25:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:47,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:47,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:47,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:47,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:25:47,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 112 transitions, 1196 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:47,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:47,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:25:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:49,515 INFO L124 PetriNetUnfolderBase]: 13916/19386 cut-off events. [2023-11-17 11:25:49,516 INFO L125 PetriNetUnfolderBase]: For 110579/112475 co-relation queries the response was YES. [2023-11-17 11:25:49,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97582 conditions, 19386 events. 13916/19386 cut-off events. For 110579/112475 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 111798 event pairs, 2211 based on Foata normal form. 1016/19583 useless extension candidates. Maximal degree in co-relation 97554. Up to 12432 conditions per place. [2023-11-17 11:25:49,700 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 108 selfloop transitions, 28 changer transitions 0/154 dead transitions. [2023-11-17 11:25:49,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 154 transitions, 1786 flow [2023-11-17 11:25:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2023-11-17 11:25:49,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2023-11-17 11:25:49,702 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 172 transitions. [2023-11-17 11:25:49,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 172 transitions. [2023-11-17 11:25:49,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:49,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 172 transitions. [2023-11-17 11:25:49,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:49,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:49,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:49,704 INFO L175 Difference]: Start difference. First operand has 65 places, 112 transitions, 1196 flow. Second operand 5 states and 172 transitions. [2023-11-17 11:25:49,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 154 transitions, 1786 flow [2023-11-17 11:25:49,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 154 transitions, 1729 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:49,845 INFO L231 Difference]: Finished difference. Result has 69 places, 124 transitions, 1389 flow [2023-11-17 11:25:49,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1389, PETRI_PLACES=69, PETRI_TRANSITIONS=124} [2023-11-17 11:25:49,846 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-11-17 11:25:49,846 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 124 transitions, 1389 flow [2023-11-17 11:25:49,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:49,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:49,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:49,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:25:49,847 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:49,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 181101397, now seen corresponding path program 1 times [2023-11-17 11:25:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274520219] [2023-11-17 11:25:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274520219] [2023-11-17 11:25:50,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274520219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:50,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:50,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802728587] [2023-11-17 11:25:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:50,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:50,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 74 [2023-11-17 11:25:50,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 124 transitions, 1389 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:50,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:50,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 74 [2023-11-17 11:25:50,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:52,099 INFO L124 PetriNetUnfolderBase]: 11240/15890 cut-off events. [2023-11-17 11:25:52,099 INFO L125 PetriNetUnfolderBase]: For 142522/147766 co-relation queries the response was YES. [2023-11-17 11:25:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85075 conditions, 15890 events. 11240/15890 cut-off events. For 142522/147766 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 95327 event pairs, 1402 based on Foata normal form. 3206/18352 useless extension candidates. Maximal degree in co-relation 85045. Up to 9471 conditions per place. [2023-11-17 11:25:52,186 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 248 selfloop transitions, 6 changer transitions 0/276 dead transitions. [2023-11-17 11:25:52,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 276 transitions, 3694 flow [2023-11-17 11:25:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-11-17 11:25:52,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2023-11-17 11:25:52,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 132 transitions. [2023-11-17 11:25:52,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 132 transitions. [2023-11-17 11:25:52,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:52,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 132 transitions. [2023-11-17 11:25:52,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:52,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:52,190 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:52,190 INFO L175 Difference]: Start difference. First operand has 69 places, 124 transitions, 1389 flow. Second operand 4 states and 132 transitions. [2023-11-17 11:25:52,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 276 transitions, 3694 flow [2023-11-17 11:25:52,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 276 transitions, 3509 flow, removed 74 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:52,300 INFO L231 Difference]: Finished difference. Result has 72 places, 128 transitions, 1373 flow [2023-11-17 11:25:52,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1373, PETRI_PLACES=72, PETRI_TRANSITIONS=128} [2023-11-17 11:25:52,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2023-11-17 11:25:52,300 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 128 transitions, 1373 flow [2023-11-17 11:25:52,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:52,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:52,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:52,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:25:52,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:52,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 755979881, now seen corresponding path program 1 times [2023-11-17 11:25:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:52,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703591827] [2023-11-17 11:25:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:52,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703591827] [2023-11-17 11:25:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703591827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602477478] [2023-11-17 11:25:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:52,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:52,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 74 [2023-11-17 11:25:52,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 128 transitions, 1373 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:52,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:52,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 74 [2023-11-17 11:25:52,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:53,919 INFO L124 PetriNetUnfolderBase]: 8883/12793 cut-off events. [2023-11-17 11:25:53,919 INFO L125 PetriNetUnfolderBase]: For 112233/118007 co-relation queries the response was YES. [2023-11-17 11:25:53,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70640 conditions, 12793 events. 8883/12793 cut-off events. For 112233/118007 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 77559 event pairs, 1216 based on Foata normal form. 2732/14825 useless extension candidates. Maximal degree in co-relation 70608. Up to 7296 conditions per place. [2023-11-17 11:25:53,988 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 272 selfloop transitions, 10 changer transitions 0/304 dead transitions. [2023-11-17 11:25:53,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 304 transitions, 3869 flow [2023-11-17 11:25:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2023-11-17 11:25:53,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2023-11-17 11:25:53,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 168 transitions. [2023-11-17 11:25:53,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions. [2023-11-17 11:25:53,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:53,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions. [2023-11-17 11:25:53,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:53,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:53,992 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:53,992 INFO L175 Difference]: Start difference. First operand has 72 places, 128 transitions, 1373 flow. Second operand 5 states and 168 transitions. [2023-11-17 11:25:53,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 304 transitions, 3869 flow [2023-11-17 11:25:54,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 304 transitions, 3866 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:54,052 INFO L231 Difference]: Finished difference. Result has 77 places, 127 transitions, 1372 flow [2023-11-17 11:25:54,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1372, PETRI_PLACES=77, PETRI_TRANSITIONS=127} [2023-11-17 11:25:54,052 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-11-17 11:25:54,052 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 127 transitions, 1372 flow [2023-11-17 11:25:54,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:54,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:54,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:54,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:25:54,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:54,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1219939196, now seen corresponding path program 1 times [2023-11-17 11:25:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498152474] [2023-11-17 11:25:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498152474] [2023-11-17 11:25:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498152474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:54,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769912752] [2023-11-17 11:25:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:54,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2023-11-17 11:25:54,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 127 transitions, 1372 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:54,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:54,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2023-11-17 11:25:54,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:57,319 INFO L124 PetriNetUnfolderBase]: 17073/24404 cut-off events. [2023-11-17 11:25:57,319 INFO L125 PetriNetUnfolderBase]: For 155284/155284 co-relation queries the response was YES. [2023-11-17 11:25:57,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135452 conditions, 24404 events. 17073/24404 cut-off events. For 155284/155284 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 145740 event pairs, 2678 based on Foata normal form. 75/24479 useless extension candidates. Maximal degree in co-relation 135417. Up to 13263 conditions per place. [2023-11-17 11:25:57,452 INFO L140 encePairwiseOnDemand]: 60/74 looper letters, 167 selfloop transitions, 95 changer transitions 93/355 dead transitions. [2023-11-17 11:25:57,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 355 transitions, 4382 flow [2023-11-17 11:25:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2023-11-17 11:25:57,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2023-11-17 11:25:57,454 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 210 transitions. [2023-11-17 11:25:57,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 210 transitions. [2023-11-17 11:25:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:57,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 210 transitions. [2023-11-17 11:25:57,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:57,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:57,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:57,456 INFO L175 Difference]: Start difference. First operand has 77 places, 127 transitions, 1372 flow. Second operand 6 states and 210 transitions. [2023-11-17 11:25:57,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 355 transitions, 4382 flow [2023-11-17 11:25:57,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 355 transitions, 4327 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:57,654 INFO L231 Difference]: Finished difference. Result has 85 places, 179 transitions, 2420 flow [2023-11-17 11:25:57,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2420, PETRI_PLACES=85, PETRI_TRANSITIONS=179} [2023-11-17 11:25:57,655 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-11-17 11:25:57,655 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 179 transitions, 2420 flow [2023-11-17 11:25:57,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:57,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:57,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:57,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:25:57,656 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:57,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1978483719, now seen corresponding path program 1 times [2023-11-17 11:25:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880043912] [2023-11-17 11:25:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:57,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-11-17 11:25:57,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880043912] [2023-11-17 11:25:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880043912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:25:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214827712] [2023-11-17 11:25:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:57,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:57,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:57,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:57,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 74 [2023-11-17 11:25:57,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 179 transitions, 2420 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:57,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:57,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 74 [2023-11-17 11:25:57,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:58,898 INFO L124 PetriNetUnfolderBase]: 4863/7413 cut-off events. [2023-11-17 11:25:58,898 INFO L125 PetriNetUnfolderBase]: For 78631/80344 co-relation queries the response was YES. [2023-11-17 11:25:58,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45775 conditions, 7413 events. 4863/7413 cut-off events. For 78631/80344 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 44391 event pairs, 402 based on Foata normal form. 1002/8277 useless extension candidates. Maximal degree in co-relation 45735. Up to 4025 conditions per place. [2023-11-17 11:25:58,950 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 304 selfloop transitions, 14 changer transitions 9/365 dead transitions. [2023-11-17 11:25:58,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 365 transitions, 5475 flow [2023-11-17 11:25:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2023-11-17 11:25:58,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-11-17 11:25:58,952 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 200 transitions. [2023-11-17 11:25:58,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 200 transitions. [2023-11-17 11:25:58,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:58,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 200 transitions. [2023-11-17 11:25:58,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:58,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:58,955 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:58,956 INFO L175 Difference]: Start difference. First operand has 85 places, 179 transitions, 2420 flow. Second operand 6 states and 200 transitions. [2023-11-17 11:25:58,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 365 transitions, 5475 flow [2023-11-17 11:25:59,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 365 transitions, 5238 flow, removed 60 selfloop flow, removed 6 redundant places. [2023-11-17 11:25:59,099 INFO L231 Difference]: Finished difference. Result has 86 places, 177 transitions, 2262 flow [2023-11-17 11:25:59,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2262, PETRI_PLACES=86, PETRI_TRANSITIONS=177} [2023-11-17 11:25:59,100 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-11-17 11:25:59,100 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 177 transitions, 2262 flow [2023-11-17 11:25:59,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:59,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:59,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:59,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:25:59,101 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:59,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash 679996237, now seen corresponding path program 1 times [2023-11-17 11:25:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659048842] [2023-11-17 11:25:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659048842] [2023-11-17 11:25:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659048842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:59,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:25:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425483649] [2023-11-17 11:25:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:59,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:25:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:25:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:25:59,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 74 [2023-11-17 11:25:59,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 177 transitions, 2262 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:59,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:59,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 74 [2023-11-17 11:25:59,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:00,295 INFO L124 PetriNetUnfolderBase]: 4791/7280 cut-off events. [2023-11-17 11:26:00,295 INFO L125 PetriNetUnfolderBase]: For 63135/64590 co-relation queries the response was YES. [2023-11-17 11:26:00,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44273 conditions, 7280 events. 4791/7280 cut-off events. For 63135/64590 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 43658 event pairs, 400 based on Foata normal form. 620/7768 useless extension candidates. Maximal degree in co-relation 44233. Up to 3916 conditions per place. [2023-11-17 11:26:00,338 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 233 selfloop transitions, 18 changer transitions 64/343 dead transitions. [2023-11-17 11:26:00,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 343 transitions, 4973 flow [2023-11-17 11:26:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:26:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:26:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2023-11-17 11:26:00,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015444015444015 [2023-11-17 11:26:00,340 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 208 transitions. [2023-11-17 11:26:00,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 208 transitions. [2023-11-17 11:26:00,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:00,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 208 transitions. [2023-11-17 11:26:00,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:00,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:00,342 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:00,342 INFO L175 Difference]: Start difference. First operand has 86 places, 177 transitions, 2262 flow. Second operand 7 states and 208 transitions. [2023-11-17 11:26:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 343 transitions, 4973 flow [2023-11-17 11:26:00,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 343 transitions, 4874 flow, removed 37 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:00,486 INFO L231 Difference]: Finished difference. Result has 90 places, 142 transitions, 1734 flow [2023-11-17 11:26:00,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1734, PETRI_PLACES=90, PETRI_TRANSITIONS=142} [2023-11-17 11:26:00,487 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2023-11-17 11:26:00,487 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 142 transitions, 1734 flow [2023-11-17 11:26:00,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:00,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:00,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:00,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:26:00,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:00,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1195483062, now seen corresponding path program 1 times [2023-11-17 11:26:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833893735] [2023-11-17 11:26:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833893735] [2023-11-17 11:26:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833893735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192529105] [2023-11-17 11:26:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:00,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2023-11-17 11:26:00,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 142 transitions, 1734 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:00,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:00,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2023-11-17 11:26:00,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:01,929 INFO L124 PetriNetUnfolderBase]: 5554/8453 cut-off events. [2023-11-17 11:26:01,929 INFO L125 PetriNetUnfolderBase]: For 53450/53450 co-relation queries the response was YES. [2023-11-17 11:26:01,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49630 conditions, 8453 events. 5554/8453 cut-off events. For 53450/53450 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 48288 event pairs, 828 based on Foata normal form. 1/8454 useless extension candidates. Maximal degree in co-relation 49601. Up to 3998 conditions per place. [2023-11-17 11:26:01,968 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 106 selfloop transitions, 34 changer transitions 148/288 dead transitions. [2023-11-17 11:26:01,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 288 transitions, 3823 flow [2023-11-17 11:26:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2023-11-17 11:26:01,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2023-11-17 11:26:01,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 192 transitions. [2023-11-17 11:26:01,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 192 transitions. [2023-11-17 11:26:01,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:01,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 192 transitions. [2023-11-17 11:26:01,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:01,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:01,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:01,972 INFO L175 Difference]: Start difference. First operand has 90 places, 142 transitions, 1734 flow. Second operand 6 states and 192 transitions. [2023-11-17 11:26:01,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 288 transitions, 3823 flow [2023-11-17 11:26:02,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 288 transitions, 3691 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-11-17 11:26:02,114 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 1144 flow [2023-11-17 11:26:02,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1144, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2023-11-17 11:26:02,114 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2023-11-17 11:26:02,115 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 1144 flow [2023-11-17 11:26:02,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:02,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:02,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:02,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:26:02,115 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:02,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1239639894, now seen corresponding path program 2 times [2023-11-17 11:26:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:02,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466853100] [2023-11-17 11:26:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:02,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466853100] [2023-11-17 11:26:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466853100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838827305] [2023-11-17 11:26:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:02,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:02,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 74 [2023-11-17 11:26:02,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 1144 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:02,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:02,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 74 [2023-11-17 11:26:02,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:03,066 INFO L124 PetriNetUnfolderBase]: 2569/4015 cut-off events. [2023-11-17 11:26:03,066 INFO L125 PetriNetUnfolderBase]: For 23002/23002 co-relation queries the response was YES. [2023-11-17 11:26:03,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23133 conditions, 4015 events. 2569/4015 cut-off events. For 23002/23002 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 21022 event pairs, 750 based on Foata normal form. 1/4016 useless extension candidates. Maximal degree in co-relation 23103. Up to 2230 conditions per place. [2023-11-17 11:26:03,079 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 59 selfloop transitions, 5 changer transitions 73/137 dead transitions. [2023-11-17 11:26:03,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 1745 flow [2023-11-17 11:26:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2023-11-17 11:26:03,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222972972972973 [2023-11-17 11:26:03,081 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 125 transitions. [2023-11-17 11:26:03,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 125 transitions. [2023-11-17 11:26:03,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:03,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 125 transitions. [2023-11-17 11:26:03,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:03,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:03,082 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:03,082 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 1144 flow. Second operand 4 states and 125 transitions. [2023-11-17 11:26:03,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 1745 flow [2023-11-17 11:26:03,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 137 transitions, 1503 flow, removed 23 selfloop flow, removed 15 redundant places. [2023-11-17 11:26:03,141 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 385 flow [2023-11-17 11:26:03,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2023-11-17 11:26:03,142 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-11-17 11:26:03,142 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 385 flow [2023-11-17 11:26:03,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:03,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:03,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:26:03,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:03,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1449533480, now seen corresponding path program 3 times [2023-11-17 11:26:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873263943] [2023-11-17 11:26:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:04,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873263943] [2023-11-17 11:26:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873263943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:26:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230492436] [2023-11-17 11:26:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:04,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:26:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:26:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:26:04,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:26:04,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:04,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:04,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:26:04,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:04,653 INFO L124 PetriNetUnfolderBase]: 1131/1830 cut-off events. [2023-11-17 11:26:04,653 INFO L125 PetriNetUnfolderBase]: For 9495/9536 co-relation queries the response was YES. [2023-11-17 11:26:04,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8582 conditions, 1830 events. 1131/1830 cut-off events. For 9495/9536 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8566 event pairs, 206 based on Foata normal form. 23/1813 useless extension candidates. Maximal degree in co-relation 8548. Up to 1096 conditions per place. [2023-11-17 11:26:04,660 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 59 selfloop transitions, 8 changer transitions 13/84 dead transitions. [2023-11-17 11:26:04,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 710 flow [2023-11-17 11:26:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2023-11-17 11:26:04,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2023-11-17 11:26:04,661 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 160 transitions. [2023-11-17 11:26:04,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 160 transitions. [2023-11-17 11:26:04,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:04,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 160 transitions. [2023-11-17 11:26:04,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:04,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:04,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:04,663 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 385 flow. Second operand 5 states and 160 transitions. [2023-11-17 11:26:04,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 710 flow [2023-11-17 11:26:04,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 561 flow, removed 51 selfloop flow, removed 18 redundant places. [2023-11-17 11:26:04,680 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 306 flow [2023-11-17 11:26:04,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-11-17 11:26:04,680 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2023-11-17 11:26:04,681 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 306 flow [2023-11-17 11:26:04,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:04,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:04,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:04,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:26:04,681 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:04,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1641135146, now seen corresponding path program 4 times [2023-11-17 11:26:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449097075] [2023-11-17 11:26:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:06,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449097075] [2023-11-17 11:26:06,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449097075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:06,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:06,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:26:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259945486] [2023-11-17 11:26:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:06,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:26:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:26:06,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:26:06,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2023-11-17 11:26:06,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 306 flow. Second operand has 10 states, 10 states have (on average 25.4) internal successors, (254), 10 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:06,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:06,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2023-11-17 11:26:06,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:07,045 INFO L124 PetriNetUnfolderBase]: 1381/2290 cut-off events. [2023-11-17 11:26:07,046 INFO L125 PetriNetUnfolderBase]: For 4717/4758 co-relation queries the response was YES. [2023-11-17 11:26:07,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8488 conditions, 2290 events. 1381/2290 cut-off events. For 4717/4758 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11639 event pairs, 217 based on Foata normal form. 28/2271 useless extension candidates. Maximal degree in co-relation 8467. Up to 791 conditions per place. [2023-11-17 11:26:07,052 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 75 selfloop transitions, 12 changer transitions 76/167 dead transitions. [2023-11-17 11:26:07,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 167 transitions, 1144 flow [2023-11-17 11:26:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:26:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:26:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2023-11-17 11:26:07,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2023-11-17 11:26:07,054 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 280 transitions. [2023-11-17 11:26:07,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 280 transitions. [2023-11-17 11:26:07,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:07,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 280 transitions. [2023-11-17 11:26:07,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:07,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:07,055 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:07,056 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 306 flow. Second operand 8 states and 280 transitions. [2023-11-17 11:26:07,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 167 transitions, 1144 flow [2023-11-17 11:26:07,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 167 transitions, 1123 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 11:26:07,061 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 371 flow [2023-11-17 11:26:07,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-11-17 11:26:07,062 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-11-17 11:26:07,062 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 371 flow [2023-11-17 11:26:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.4) internal successors, (254), 10 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:07,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:07,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:26:07,062 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:07,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2088896914, now seen corresponding path program 5 times [2023-11-17 11:26:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:07,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232899362] [2023-11-17 11:26:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:07,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:26:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:07,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:26:07,175 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:26:07,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:26:07,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:26:07,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:26:07,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:26:07,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:26:07,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:26:07,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:26:07,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 11:26:07,181 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:07,187 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:26:07,187 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:26:07,251 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:26:07,254 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:26:07,256 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:26:07,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:26:07,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:26:07 BasicIcfg [2023-11-17 11:26:07,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:26:07,293 INFO L158 Benchmark]: Toolchain (without parser) took 38443.11ms. Allocated memory was 261.1MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 206.7MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 11:26:07,293 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 133.9MB in the beginning and 133.8MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:26:07,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.58ms. Allocated memory is still 261.1MB. Free memory was 206.1MB in the beginning and 182.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:07,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.61ms. Allocated memory is still 261.1MB. Free memory was 182.0MB in the beginning and 179.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:07,293 INFO L158 Benchmark]: Boogie Preprocessor took 37.61ms. Allocated memory is still 261.1MB. Free memory was 179.4MB in the beginning and 177.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:07,294 INFO L158 Benchmark]: RCFGBuilder took 825.25ms. Allocated memory is still 261.1MB. Free memory was 177.3MB in the beginning and 123.8MB in the end (delta: 53.5MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-11-17 11:26:07,294 INFO L158 Benchmark]: TraceAbstraction took 36942.95ms. Allocated memory was 261.1MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 123.3MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 11:26:07,295 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 133.9MB in the beginning and 133.8MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 577.58ms. Allocated memory is still 261.1MB. Free memory was 206.1MB in the beginning and 182.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.61ms. Allocated memory is still 261.1MB. Free memory was 182.0MB in the beginning and 179.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.61ms. Allocated memory is still 261.1MB. Free memory was 179.4MB in the beginning and 177.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 825.25ms. Allocated memory is still 261.1MB. Free memory was 177.3MB in the beginning and 123.8MB in the end (delta: 53.5MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * TraceAbstraction took 36942.95ms. Allocated memory was 261.1MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 123.3MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 57 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 31 TransitionsAfterwards, 1298 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 24 TotalNumberOfCompositions, 4264 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1785, independent: 1637, independent conditional: 0, independent unconditional: 1637, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 886, independent: 844, independent conditional: 0, independent unconditional: 844, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 886, independent: 809, independent conditional: 0, independent unconditional: 809, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 220, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1785, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 886, unknown conditional: 0, unknown unconditional: 886] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 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: 36.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1929 IncrementalHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 57 mSDtfsCounter, 1929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2420occurred in iteration=11, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 4343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:26:07,314 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...