/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:18:32,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:18:32,237 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 15:18:32,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:18:32,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:18:32,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:18:32,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:18:32,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:18:32,281 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:18:32,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:18:32,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:18:32,285 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:18:32,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:18:32,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:18:32,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:18:32,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:18:32,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:18:32,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:18:32,288 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:18:32,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:18:32,288 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:18:32,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:18:32,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:18:32,290 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:18:32,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:18:32,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:32,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:18:32,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:18:32,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:18:32,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:18:32,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:18:32,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:18:32,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:18:32,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:18:32,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:18:32,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:18:32,565 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:18:32,569 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:18:32,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-11-17 15:18:33,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:18:34,196 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:18:34,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-11-17 15:18:34,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915bac8e8/2cb5828215c94f1d8cb906b6c4b97df7/FLAGa64bc6627 [2023-11-17 15:18:34,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915bac8e8/2cb5828215c94f1d8cb906b6c4b97df7 [2023-11-17 15:18:34,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:18:34,233 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:18:34,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:34,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:18:34,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:18:34,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:34,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c442d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34, skipping insertion in model container [2023-11-17 15:18:34,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:34,294 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:18:34,490 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/safe015_rmo.i[988,1001] [2023-11-17 15:18:34,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:34,786 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:18:34,798 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/safe015_rmo.i[988,1001] [2023-11-17 15:18:34,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:34,901 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:34,902 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:34,909 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:18:34,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34 WrapperNode [2023-11-17 15:18:34,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:34,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:34,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:18:34,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:18:34,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:34,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,005 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2023-11-17 15:18:35,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:35,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:18:35,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:18:35,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:18:35,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:18:35,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:18:35,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:18:35,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:18:35,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (1/1) ... [2023-11-17 15:18:35,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:18:35,099 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 15:18:35,101 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 15:18:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:18:35,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:18:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:18:35,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:18:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:18:35,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:18:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:18:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:18:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:18:35,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:18:35,126 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 15:18:35,294 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:18:35,296 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:18:35,706 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:18:36,019 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:18:36,020 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:18:36,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:36 BoogieIcfgContainer [2023-11-17 15:18:36,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:18:36,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:18:36,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:18:36,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:18:36,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:18:34" (1/3) ... [2023-11-17 15:18:36,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb42f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:36, skipping insertion in model container [2023-11-17 15:18:36,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:34" (2/3) ... [2023-11-17 15:18:36,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb42f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:36, skipping insertion in model container [2023-11-17 15:18:36,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:36" (3/3) ... [2023-11-17 15:18:36,031 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_rmo.i [2023-11-17 15:18:36,048 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:18:36,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 15:18:36,049 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:18:36,152 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:18:36,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 270 flow [2023-11-17 15:18:36,271 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-11-17 15:18:36,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:36,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-17 15:18:36,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 270 flow [2023-11-17 15:18:36,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 111 transitions, 231 flow [2023-11-17 15:18:36,288 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:18:36,306 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 111 transitions, 231 flow [2023-11-17 15:18:36,310 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 111 transitions, 231 flow [2023-11-17 15:18:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 111 transitions, 231 flow [2023-11-17 15:18:36,357 INFO L124 PetriNetUnfolderBase]: 1/111 cut-off events. [2023-11-17 15:18:36,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:36,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 1/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:18:36,361 INFO L119 LiptonReduction]: Number of co-enabled transitions 1436 [2023-11-17 15:18:45,725 INFO L134 LiptonReduction]: Checked pairs total: 3739 [2023-11-17 15:18:45,725 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-11-17 15:18:45,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:18:45,752 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;@25a04135, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:18:45,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 15:18:45,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:18:45,789 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-17 15:18:45,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:45,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:45,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:45,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:45,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1586668133, now seen corresponding path program 1 times [2023-11-17 15:18:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845040899] [2023-11-17 15:18:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:46,038 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 15:18:46,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:46,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845040899] [2023-11-17 15:18:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845040899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:46,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279534213] [2023-11-17 15:18:46,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:46,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:18:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:18:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:18:46,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 225 [2023-11-17 15:18:46,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 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 15:18:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 225 [2023-11-17 15:18:46,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:46,414 INFO L124 PetriNetUnfolderBase]: 725/1106 cut-off events. [2023-11-17 15:18:46,415 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-17 15:18:46,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1106 events. 725/1106 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4445 event pairs, 725 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2244. Up to 1095 conditions per place. [2023-11-17 15:18:46,423 INFO L140 encePairwiseOnDemand]: 224/225 looper letters, 19 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-11-17 15:18:46,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 87 flow [2023-11-17 15:18:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:18:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:18:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2023-11-17 15:18:46,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-11-17 15:18:46,437 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2023-11-17 15:18:46,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2023-11-17 15:18:46,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:46,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2023-11-17 15:18:46,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 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 15:18:46,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:46,447 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:46,449 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 250 transitions. [2023-11-17 15:18:46,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 87 flow [2023-11-17 15:18:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:18:46,453 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2023-11-17 15:18:46,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-17 15:18:46,458 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2023-11-17 15:18:46,458 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 46 flow [2023-11-17 15:18:46,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 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 15:18:46,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:46,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:46,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:18:46,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:46,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash 74681757, now seen corresponding path program 1 times [2023-11-17 15:18:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11719031] [2023-11-17 15:18:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:47,026 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 15:18:47,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11719031] [2023-11-17 15:18:47,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11719031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:47,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:47,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602883613] [2023-11-17 15:18:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:47,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:47,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:47,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 225 [2023-11-17 15:18:47,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 15:18:47,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:47,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 225 [2023-11-17 15:18:47,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:47,310 INFO L124 PetriNetUnfolderBase]: 674/1083 cut-off events. [2023-11-17 15:18:47,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:47,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 1083 events. 674/1083 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4627 event pairs, 182 based on Foata normal form. 20/1103 useless extension candidates. Maximal degree in co-relation 2156. Up to 773 conditions per place. [2023-11-17 15:18:47,317 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 26 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-11-17 15:18:47,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 120 flow [2023-11-17 15:18:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-17 15:18:47,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451851851851852 [2023-11-17 15:18:47,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-17 15:18:47,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-17 15:18:47,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:47,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-17 15:18:47,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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 15:18:47,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:47,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:47,330 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 46 flow. Second operand 3 states and 368 transitions. [2023-11-17 15:18:47,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 120 flow [2023-11-17 15:18:47,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:18:47,332 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 54 flow [2023-11-17 15:18:47,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-11-17 15:18:47,333 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-11-17 15:18:47,333 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 54 flow [2023-11-17 15:18:47,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 15:18:47,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:47,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:47,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:18:47,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:47,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1979833860, now seen corresponding path program 1 times [2023-11-17 15:18:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375768302] [2023-11-17 15:18:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375768302] [2023-11-17 15:18:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375768302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:47,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265358461] [2023-11-17 15:18:47,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:47,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:47,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:47,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 225 [2023-11-17 15:18:47,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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 15:18:47,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:47,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 225 [2023-11-17 15:18:47,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:47,842 INFO L124 PetriNetUnfolderBase]: 844/1268 cut-off events. [2023-11-17 15:18:47,842 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-11-17 15:18:47,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1268 events. 844/1268 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5094 event pairs, 223 based on Foata normal form. 5/1273 useless extension candidates. Maximal degree in co-relation 2782. Up to 1188 conditions per place. [2023-11-17 15:18:47,850 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-11-17 15:18:47,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 153 flow [2023-11-17 15:18:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-17 15:18:47,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2023-11-17 15:18:47,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-17 15:18:47,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-17 15:18:47,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:47,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-17 15:18:47,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 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 15:18:47,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:47,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:47,855 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 54 flow. Second operand 3 states and 370 transitions. [2023-11-17 15:18:47,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 153 flow [2023-11-17 15:18:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:47,857 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 69 flow [2023-11-17 15:18:47,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 15:18:47,858 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-17 15:18:47,858 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 69 flow [2023-11-17 15:18:47,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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 15:18:47,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:47,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:47,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:18:47,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:47,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1246374854, now seen corresponding path program 1 times [2023-11-17 15:18:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:47,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692017649] [2023-11-17 15:18:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:49,248 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 15:18:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692017649] [2023-11-17 15:18:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692017649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815888995] [2023-11-17 15:18:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:49,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:49,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 225 [2023-11-17 15:18:49,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 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 15:18:49,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:49,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 225 [2023-11-17 15:18:49,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:49,571 INFO L124 PetriNetUnfolderBase]: 772/1167 cut-off events. [2023-11-17 15:18:49,572 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-11-17 15:18:49,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1167 events. 772/1167 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4778 event pairs, 233 based on Foata normal form. 15/1165 useless extension candidates. Maximal degree in co-relation 2731. Up to 1002 conditions per place. [2023-11-17 15:18:49,579 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-11-17 15:18:49,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 161 flow [2023-11-17 15:18:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-11-17 15:18:49,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2023-11-17 15:18:49,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-11-17 15:18:49,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-11-17 15:18:49,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:49,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-11-17 15:18:49,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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 15:18:49,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:49,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:49,584 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 69 flow. Second operand 3 states and 309 transitions. [2023-11-17 15:18:49,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 161 flow [2023-11-17 15:18:49,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:49,585 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 74 flow [2023-11-17 15:18:49,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-11-17 15:18:49,586 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-11-17 15:18:49,586 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 74 flow [2023-11-17 15:18:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 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 15:18:49,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:49,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:49,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:18:49,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:49,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -345152358, now seen corresponding path program 1 times [2023-11-17 15:18:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482090647] [2023-11-17 15:18:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:49,942 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 15:18:49,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482090647] [2023-11-17 15:18:49,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482090647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:49,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:49,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:49,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929033543] [2023-11-17 15:18:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:49,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:49,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 225 [2023-11-17 15:18:49,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:49,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:49,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 225 [2023-11-17 15:18:49,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:50,231 INFO L124 PetriNetUnfolderBase]: 889/1347 cut-off events. [2023-11-17 15:18:50,231 INFO L125 PetriNetUnfolderBase]: For 534/534 co-relation queries the response was YES. [2023-11-17 15:18:50,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1347 events. 889/1347 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5773 event pairs, 586 based on Foata normal form. 15/1330 useless extension candidates. Maximal degree in co-relation 3281. Up to 1195 conditions per place. [2023-11-17 15:18:50,239 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 24 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2023-11-17 15:18:50,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 169 flow [2023-11-17 15:18:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-11-17 15:18:50,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-11-17 15:18:50,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-11-17 15:18:50,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-11-17 15:18:50,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:50,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-11-17 15:18:50,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 15:18:50,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:50,245 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:50,245 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 74 flow. Second operand 4 states and 455 transitions. [2023-11-17 15:18:50,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 169 flow [2023-11-17 15:18:50,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:50,247 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 120 flow [2023-11-17 15:18:50,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-17 15:18:50,247 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-11-17 15:18:50,248 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 120 flow [2023-11-17 15:18:50,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:50,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:50,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:50,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:18:50,248 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:50,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash -345182118, now seen corresponding path program 2 times [2023-11-17 15:18:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118771817] [2023-11-17 15:18:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:50,854 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 15:18:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118771817] [2023-11-17 15:18:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118771817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028296695] [2023-11-17 15:18:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:50,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 225 [2023-11-17 15:18:50,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 15:18:50,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:50,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 225 [2023-11-17 15:18:50,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:51,177 INFO L124 PetriNetUnfolderBase]: 895/1370 cut-off events. [2023-11-17 15:18:51,177 INFO L125 PetriNetUnfolderBase]: For 1047/1115 co-relation queries the response was YES. [2023-11-17 15:18:51,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 1370 events. 895/1370 cut-off events. For 1047/1115 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5962 event pairs, 565 based on Foata normal form. 37/1373 useless extension candidates. Maximal degree in co-relation 4127. Up to 1184 conditions per place. [2023-11-17 15:18:51,187 INFO L140 encePairwiseOnDemand]: 217/225 looper letters, 25 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-11-17 15:18:51,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 227 flow [2023-11-17 15:18:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-11-17 15:18:51,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-11-17 15:18:51,189 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-11-17 15:18:51,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-11-17 15:18:51,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:51,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-11-17 15:18:51,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 15:18:51,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:51,193 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:51,193 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 120 flow. Second operand 4 states and 455 transitions. [2023-11-17 15:18:51,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 227 flow [2023-11-17 15:18:51,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:51,195 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 170 flow [2023-11-17 15:18:51,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-11-17 15:18:51,196 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-11-17 15:18:51,196 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 170 flow [2023-11-17 15:18:51,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 15:18:51,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:51,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:51,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:18:51,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:51,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -341376558, now seen corresponding path program 3 times [2023-11-17 15:18:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739566002] [2023-11-17 15:18:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:52,043 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 15:18:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739566002] [2023-11-17 15:18:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739566002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143400456] [2023-11-17 15:18:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:52,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:18:52,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:52,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:18:52,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:18:52,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 225 [2023-11-17 15:18:52,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:52,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:52,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 225 [2023-11-17 15:18:52,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:52,425 INFO L124 PetriNetUnfolderBase]: 987/1508 cut-off events. [2023-11-17 15:18:52,426 INFO L125 PetriNetUnfolderBase]: For 2071/2095 co-relation queries the response was YES. [2023-11-17 15:18:52,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5219 conditions, 1508 events. 987/1508 cut-off events. For 2071/2095 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6734 event pairs, 586 based on Foata normal form. 27/1503 useless extension candidates. Maximal degree in co-relation 5210. Up to 1216 conditions per place. [2023-11-17 15:18:52,438 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 32 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2023-11-17 15:18:52,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 305 flow [2023-11-17 15:18:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-11-17 15:18:52,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011111111111111 [2023-11-17 15:18:52,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-11-17 15:18:52,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-11-17 15:18:52,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:52,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-11-17 15:18:52,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 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 15:18:52,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:52,444 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:52,444 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 170 flow. Second operand 4 states and 451 transitions. [2023-11-17 15:18:52,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 305 flow [2023-11-17 15:18:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:52,450 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 211 flow [2023-11-17 15:18:52,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-11-17 15:18:52,451 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-11-17 15:18:52,451 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 211 flow [2023-11-17 15:18:52,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:52,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:52,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:18:52,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:52,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 854722700, now seen corresponding path program 4 times [2023-11-17 15:18:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862851650] [2023-11-17 15:18:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:53,346 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 15:18:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862851650] [2023-11-17 15:18:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862851650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:53,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997537992] [2023-11-17 15:18:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:53,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 225 [2023-11-17 15:18:53,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:53,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:53,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 225 [2023-11-17 15:18:53,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:53,832 INFO L124 PetriNetUnfolderBase]: 1021/1574 cut-off events. [2023-11-17 15:18:53,832 INFO L125 PetriNetUnfolderBase]: For 3125/3161 co-relation queries the response was YES. [2023-11-17 15:18:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5911 conditions, 1574 events. 1021/1574 cut-off events. For 3125/3161 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7202 event pairs, 543 based on Foata normal form. 39/1584 useless extension candidates. Maximal degree in co-relation 5901. Up to 1127 conditions per place. [2023-11-17 15:18:53,846 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 43 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2023-11-17 15:18:53,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 458 flow [2023-11-17 15:18:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-17 15:18:53,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44296296296296295 [2023-11-17 15:18:53,848 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-17 15:18:53,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-17 15:18:53,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:53,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-17 15:18:53,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 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 15:18:53,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:53,852 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:53,852 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 211 flow. Second operand 6 states and 598 transitions. [2023-11-17 15:18:53,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 458 flow [2023-11-17 15:18:53,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:53,857 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 320 flow [2023-11-17 15:18:53,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-11-17 15:18:53,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2023-11-17 15:18:53,860 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 320 flow [2023-11-17 15:18:53,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:53,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:53,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:53,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:18:53,860 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:53,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1990868160, now seen corresponding path program 1 times [2023-11-17 15:18:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286557420] [2023-11-17 15:18:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:54,014 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 15:18:54,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286557420] [2023-11-17 15:18:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286557420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:54,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:54,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600498283] [2023-11-17 15:18:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:54,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 225 [2023-11-17 15:18:54,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 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 15:18:54,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:54,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 225 [2023-11-17 15:18:54,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:54,391 INFO L124 PetriNetUnfolderBase]: 818/1329 cut-off events. [2023-11-17 15:18:54,391 INFO L125 PetriNetUnfolderBase]: For 5293/5323 co-relation queries the response was YES. [2023-11-17 15:18:54,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 1329 events. 818/1329 cut-off events. For 5293/5323 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6239 event pairs, 123 based on Foata normal form. 157/1476 useless extension candidates. Maximal degree in co-relation 5624. Up to 709 conditions per place. [2023-11-17 15:18:54,402 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 66 selfloop transitions, 4 changer transitions 49/121 dead transitions. [2023-11-17 15:18:54,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 121 transitions, 1199 flow [2023-11-17 15:18:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-11-17 15:18:54,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253333333333333 [2023-11-17 15:18:54,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-11-17 15:18:54,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-11-17 15:18:54,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:54,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-11-17 15:18:54,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:54,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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 15:18:54,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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 15:18:54,410 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 320 flow. Second operand 5 states and 591 transitions. [2023-11-17 15:18:54,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 121 transitions, 1199 flow [2023-11-17 15:18:54,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 1190 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:54,422 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 357 flow [2023-11-17 15:18:54,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-17 15:18:54,424 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2023-11-17 15:18:54,424 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 357 flow [2023-11-17 15:18:54,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 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 15:18:54,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:54,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:18:54,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:54,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash -307745763, now seen corresponding path program 1 times [2023-11-17 15:18:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699395043] [2023-11-17 15:18:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:54,611 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 15:18:54,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:54,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699395043] [2023-11-17 15:18:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699395043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:54,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362430734] [2023-11-17 15:18:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:54,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:54,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:54,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 225 [2023-11-17 15:18:54,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 15:18:54,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:54,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 225 [2023-11-17 15:18:54,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:54,897 INFO L124 PetriNetUnfolderBase]: 837/1397 cut-off events. [2023-11-17 15:18:54,898 INFO L125 PetriNetUnfolderBase]: For 5573/5573 co-relation queries the response was YES. [2023-11-17 15:18:54,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 1397 events. 837/1397 cut-off events. For 5573/5573 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6643 event pairs, 284 based on Foata normal form. 29/1426 useless extension candidates. Maximal degree in co-relation 6654. Up to 859 conditions per place. [2023-11-17 15:18:54,909 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 63 selfloop transitions, 3 changer transitions 6/72 dead transitions. [2023-11-17 15:18:54,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 727 flow [2023-11-17 15:18:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-17 15:18:54,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451851851851852 [2023-11-17 15:18:54,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-17 15:18:54,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-17 15:18:54,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:54,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-17 15:18:54,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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 15:18:54,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:54,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:54,916 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 357 flow. Second operand 3 states and 368 transitions. [2023-11-17 15:18:54,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 727 flow [2023-11-17 15:18:54,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 712 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:54,931 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 360 flow [2023-11-17 15:18:54,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-17 15:18:54,932 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-11-17 15:18:54,932 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 360 flow [2023-11-17 15:18:54,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 15:18:54,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:54,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:54,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:18:54,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:54,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash 828980966, now seen corresponding path program 1 times [2023-11-17 15:18:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715936769] [2023-11-17 15:18:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:55,118 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 15:18:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715936769] [2023-11-17 15:18:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715936769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859445658] [2023-11-17 15:18:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:55,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:55,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 225 [2023-11-17 15:18:55,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:55,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:55,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 225 [2023-11-17 15:18:55,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:55,406 INFO L124 PetriNetUnfolderBase]: 538/963 cut-off events. [2023-11-17 15:18:55,406 INFO L125 PetriNetUnfolderBase]: For 3676/3698 co-relation queries the response was YES. [2023-11-17 15:18:55,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 963 events. 538/963 cut-off events. For 3676/3698 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4596 event pairs, 96 based on Foata normal form. 114/1072 useless extension candidates. Maximal degree in co-relation 4466. Up to 425 conditions per place. [2023-11-17 15:18:55,414 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 75 selfloop transitions, 7 changer transitions 38/122 dead transitions. [2023-11-17 15:18:55,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 1240 flow [2023-11-17 15:18:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2023-11-17 15:18:55,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2023-11-17 15:18:55,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2023-11-17 15:18:55,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2023-11-17 15:18:55,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:55,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2023-11-17 15:18:55,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 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 15:18:55,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:55,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:55,421 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 360 flow. Second operand 6 states and 710 transitions. [2023-11-17 15:18:55,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 1240 flow [2023-11-17 15:18:55,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 122 transitions, 1223 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:55,429 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 387 flow [2023-11-17 15:18:55,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-17 15:18:55,430 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2023-11-17 15:18:55,430 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 387 flow [2023-11-17 15:18:55,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:55,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:55,431 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 15:18:55,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:18:55,431 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:55,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1306180590, now seen corresponding path program 1 times [2023-11-17 15:18:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428305671] [2023-11-17 15:18:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:55,646 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 15:18:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428305671] [2023-11-17 15:18:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428305671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:55,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882554896] [2023-11-17 15:18:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:55,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:18:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:18:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:18:55,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 225 [2023-11-17 15:18:55,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 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 15:18:55,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:55,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 225 [2023-11-17 15:18:55,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:55,878 INFO L124 PetriNetUnfolderBase]: 348/633 cut-off events. [2023-11-17 15:18:55,878 INFO L125 PetriNetUnfolderBase]: For 2621/2635 co-relation queries the response was YES. [2023-11-17 15:18:55,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 633 events. 348/633 cut-off events. For 2621/2635 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2766 event pairs, 91 based on Foata normal form. 31/659 useless extension candidates. Maximal degree in co-relation 3138. Up to 280 conditions per place. [2023-11-17 15:18:55,883 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 57 selfloop transitions, 10 changer transitions 28/96 dead transitions. [2023-11-17 15:18:55,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 993 flow [2023-11-17 15:18:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:18:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:18:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2023-11-17 15:18:55,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123809523809524 [2023-11-17 15:18:55,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2023-11-17 15:18:55,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2023-11-17 15:18:55,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:55,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2023-11-17 15:18:55,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 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 15:18:55,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 15:18:55,892 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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 15:18:55,892 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 387 flow. Second operand 7 states and 807 transitions. [2023-11-17 15:18:55,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 993 flow [2023-11-17 15:18:55,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 811 flow, removed 60 selfloop flow, removed 9 redundant places. [2023-11-17 15:18:55,900 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 289 flow [2023-11-17 15:18:55,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-11-17 15:18:55,901 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2023-11-17 15:18:55,901 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 289 flow [2023-11-17 15:18:55,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 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 15:18:55,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:55,902 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 15:18:55,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:18:55,902 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:55,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1507388937, now seen corresponding path program 1 times [2023-11-17 15:18:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:55,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965547586] [2023-11-17 15:18:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:55,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:57,294 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 15:18:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965547586] [2023-11-17 15:18:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965547586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:57,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522827481] [2023-11-17 15:18:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:57,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:57,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:57,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 225 [2023-11-17 15:18:57,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 289 flow. Second operand has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 15:18:57,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:57,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 225 [2023-11-17 15:18:57,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:57,480 INFO L124 PetriNetUnfolderBase]: 173/343 cut-off events. [2023-11-17 15:18:57,480 INFO L125 PetriNetUnfolderBase]: For 1038/1042 co-relation queries the response was YES. [2023-11-17 15:18:57,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 343 events. 173/343 cut-off events. For 1038/1042 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1386 event pairs, 49 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1529. Up to 211 conditions per place. [2023-11-17 15:18:57,488 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 37 selfloop transitions, 17 changer transitions 21/76 dead transitions. [2023-11-17 15:18:57,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 733 flow [2023-11-17 15:18:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-11-17 15:18:57,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4871111111111111 [2023-11-17 15:18:57,491 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-11-17 15:18:57,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-11-17 15:18:57,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:57,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-11-17 15:18:57,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 15:18:57,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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 15:18:57,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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 15:18:57,495 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 289 flow. Second operand 5 states and 548 transitions. [2023-11-17 15:18:57,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 733 flow [2023-11-17 15:18:57,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 607 flow, removed 40 selfloop flow, removed 10 redundant places. [2023-11-17 15:18:57,499 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 367 flow [2023-11-17 15:18:57,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-11-17 15:18:57,500 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2023-11-17 15:18:57,500 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 367 flow [2023-11-17 15:18:57,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 15:18:57,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:57,501 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 15:18:57,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:18:57,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:57,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1690745461, now seen corresponding path program 2 times [2023-11-17 15:18:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982029698] [2023-11-17 15:18:57,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:57,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18: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 15:18:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982029698] [2023-11-17 15:18:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982029698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:57,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:57,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804780710] [2023-11-17 15:18:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:57,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:57,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 225 [2023-11-17 15:18:57,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 15:18:57,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:57,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 225 [2023-11-17 15:18:57,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:58,162 INFO L124 PetriNetUnfolderBase]: 167/354 cut-off events. [2023-11-17 15:18:58,163 INFO L125 PetriNetUnfolderBase]: For 1119/1121 co-relation queries the response was YES. [2023-11-17 15:18:58,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 354 events. 167/354 cut-off events. For 1119/1121 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1543 event pairs, 50 based on Foata normal form. 3/355 useless extension candidates. Maximal degree in co-relation 1611. Up to 260 conditions per place. [2023-11-17 15:18:58,165 INFO L140 encePairwiseOnDemand]: 217/225 looper letters, 40 selfloop transitions, 8 changer transitions 21/70 dead transitions. [2023-11-17 15:18:58,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 633 flow [2023-11-17 15:18:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-11-17 15:18:58,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49703703703703705 [2023-11-17 15:18:58,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-11-17 15:18:58,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-11-17 15:18:58,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:58,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-11-17 15:18:58,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 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 15:18:58,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:58,172 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:58,172 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 367 flow. Second operand 6 states and 671 transitions. [2023-11-17 15:18:58,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 633 flow [2023-11-17 15:18:58,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 608 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:58,178 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 325 flow [2023-11-17 15:18:58,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-17 15:18:58,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2023-11-17 15:18:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 325 flow [2023-11-17 15:18:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 15:18:58,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:58,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:58,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:18:58,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:58,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1798968857, now seen corresponding path program 3 times [2023-11-17 15:18:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701958118] [2023-11-17 15:18:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:59,191 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 15:18:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701958118] [2023-11-17 15:18:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701958118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575371638] [2023-11-17 15:18:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:59,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 225 [2023-11-17 15:18:59,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 15:18:59,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:59,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 225 [2023-11-17 15:18:59,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:59,440 INFO L124 PetriNetUnfolderBase]: 184/401 cut-off events. [2023-11-17 15:18:59,440 INFO L125 PetriNetUnfolderBase]: For 1217/1219 co-relation queries the response was YES. [2023-11-17 15:18:59,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 401 events. 184/401 cut-off events. For 1217/1219 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1862 event pairs, 51 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1760. Up to 196 conditions per place. [2023-11-17 15:18:59,443 INFO L140 encePairwiseOnDemand]: 218/225 looper letters, 33 selfloop transitions, 9 changer transitions 32/75 dead transitions. [2023-11-17 15:18:59,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 668 flow [2023-11-17 15:18:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2023-11-17 15:18:59,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837037037037037 [2023-11-17 15:18:59,446 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 653 transitions. [2023-11-17 15:18:59,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 653 transitions. [2023-11-17 15:18:59,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:59,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 653 transitions. [2023-11-17 15:18:59,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 15:18:59,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:59,450 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 15:18:59,450 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 325 flow. Second operand 6 states and 653 transitions. [2023-11-17 15:18:59,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 668 flow [2023-11-17 15:18:59,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 650 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-17 15:18:59,455 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 290 flow [2023-11-17 15:18:59,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-11-17 15:18:59,456 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2023-11-17 15:18:59,456 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 290 flow [2023-11-17 15:18:59,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 15:18:59,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:59,457 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 15:18:59,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:18:59,457 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 15:18:59,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2103472309, now seen corresponding path program 4 times [2023-11-17 15:18:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:59,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650265525] [2023-11-17 15:18:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:59,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:18:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:59,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:18:59,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:18:59,675 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 15:18:59,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 15:18:59,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 15:18:59,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 15:18:59,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 15:18:59,677 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:59,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:18:59,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:18:59,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-17 15:18:59,752 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-17 15:18:59,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-17 15:18:59,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:18:59 BasicIcfg [2023-11-17 15:18:59,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:18:59,776 INFO L158 Benchmark]: Toolchain (without parser) took 25543.64ms. Allocated memory was 192.9MB in the beginning and 721.4MB in the end (delta: 528.5MB). Free memory was 148.3MB in the beginning and 266.3MB in the end (delta: -118.0MB). Peak memory consumption was 411.2MB. Max. memory is 8.0GB. [2023-11-17 15:18:59,776 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:18:59,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.08ms. Allocated memory is still 192.9MB. Free memory was 148.3MB in the beginning and 122.5MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 15:18:59,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.31ms. Allocated memory is still 192.9MB. Free memory was 122.5MB in the beginning and 119.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:59,777 INFO L158 Benchmark]: Boogie Preprocessor took 54.05ms. Allocated memory is still 192.9MB. Free memory was 119.7MB in the beginning and 116.9MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:59,777 INFO L158 Benchmark]: RCFGBuilder took 960.25ms. Allocated memory is still 192.9MB. Free memory was 116.9MB in the beginning and 94.5MB in the end (delta: 22.5MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2023-11-17 15:18:59,778 INFO L158 Benchmark]: TraceAbstraction took 23751.44ms. Allocated memory was 192.9MB in the beginning and 721.4MB in the end (delta: 528.5MB). Free memory was 93.4MB in the beginning and 266.3MB in the end (delta: -172.9MB). Peak memory consumption was 355.0MB. Max. memory is 8.0GB. [2023-11-17 15:18:59,779 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 677.08ms. Allocated memory is still 192.9MB. Free memory was 148.3MB in the beginning and 122.5MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.31ms. Allocated memory is still 192.9MB. Free memory was 122.5MB in the beginning and 119.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.05ms. Allocated memory is still 192.9MB. Free memory was 119.7MB in the beginning and 116.9MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 960.25ms. Allocated memory is still 192.9MB. Free memory was 116.9MB in the beginning and 94.5MB in the end (delta: 22.5MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * TraceAbstraction took 23751.44ms. Allocated memory was 192.9MB in the beginning and 721.4MB in the end (delta: 528.5MB). Free memory was 93.4MB in the beginning and 266.3MB in the end (delta: -172.9MB). Peak memory consumption was 355.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 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: 9.4s, 120 PlacesBefore, 30 PlacesAfterwards, 111 TransitionsBefore, 21 TransitionsAfterwards, 1436 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 96 TotalNumberOfCompositions, 3739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1741, independent: 1570, independent conditional: 0, independent unconditional: 1570, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1005, independent: 933, independent conditional: 0, independent unconditional: 933, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 914, independent conditional: 0, independent unconditional: 914, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1202, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 1155, dependent conditional: 0, dependent unconditional: 1155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1741, independent: 637, independent conditional: 0, independent unconditional: 637, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 1005, unknown conditional: 0, unknown unconditional: 1005] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2133; [L853] FCALL, FORK 0 pthread_create(&t2133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L854] 0 pthread_t t2134; [L855] FCALL, FORK 0 pthread_create(&t2134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, t2134={8:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L856] 0 pthread_t t2135; [L857] FCALL, FORK 0 pthread_create(&t2135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 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) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L792] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 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) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 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 [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, 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, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !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) [L874] EXPR 0 \read(x) [L874] EXPR 0 !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) [L874] 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) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] - UnprovableResult [Line: 853]: 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: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 2 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=11, InterpolantAutomatonStates: 67, 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.0s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 15:18:59,831 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...