/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/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:18:31,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:18:31,747 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:31,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:18:31,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:18:31,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:18:31,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:18:31,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:18:31,854 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:18:31,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:18:31,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:18:31,855 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:18:31,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:18:31,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:18:31,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:18:31,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:18:31,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:18:31,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:18:31,856 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:18:31,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:18:31,857 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:18:31,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:18:31,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:18:31,861 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:18:31,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:18:31,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:31,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:18:31,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:18:31,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:18:31,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:18:31,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:18:31,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:18:31,863 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,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:18:32,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:18:32,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:18:32,071 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:18:32,072 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:18:32,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-11-17 15:18:33,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:18:33,275 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:18:33,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-11-17 15:18:33,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5271d85c9/713048718f454f34a289585276b135e4/FLAG9b864a038 [2023-11-17 15:18:33,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5271d85c9/713048718f454f34a289585276b135e4 [2023-11-17 15:18:33,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:18:33,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:18:33,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:33,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:18:33,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:18:33,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:33" (1/1) ... [2023-11-17 15:18:33,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bec4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:33, skipping insertion in model container [2023-11-17 15:18:33,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:33" (1/1) ... [2023-11-17 15:18:33,720 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:18:33,826 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/safe016_power.oepc.i[995,1008] [2023-11-17 15:18:33,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:33,983 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:18:33,994 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/safe016_power.oepc.i[995,1008] [2023-11-17 15:18:34,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:34,079 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:34,079 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:34,084 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:18:34,086 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,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:34,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:34,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:18:34,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:18:34,092 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,118 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:34,142 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 187 [2023-11-17 15:18:34,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:34,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:18:34,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:18:34,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:18:34,149 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:34,149 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:34,152 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:34,153 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:34,165 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:34,166 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:34,169 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:34,170 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:34,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:18:34,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:18:34,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:18:34,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:18:34,176 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:34,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:34,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:18:34,261 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:34,272 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:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:18:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:18:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:18:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:18:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:18:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:18:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:18:34,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:18:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:18:34,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:18:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:18:34,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:18:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:18:34,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:18:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:18:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:18:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:18:34,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:18:34,293 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:34,461 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:18:34,463 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:18:34,823 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:18:35,039 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:18:35,039 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:18:35,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:35 BoogieIcfgContainer [2023-11-17 15:18:35,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:18:35,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:18:35,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:18:35,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:18:35,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:18:33" (1/3) ... [2023-11-17 15:18:35,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a7de1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:35, skipping insertion in model container [2023-11-17 15:18:35,045 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:35,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a7de1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:35, skipping insertion in model container [2023-11-17 15:18:35,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:35" (3/3) ... [2023-11-17 15:18:35,046 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2023-11-17 15:18:35,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:18:35,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 15:18:35,059 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:18:35,118 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:18:35,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 310 flow [2023-11-17 15:18:35,238 INFO L124 PetriNetUnfolderBase]: 2/143 cut-off events. [2023-11-17 15:18:35,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:35,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-17 15:18:35,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 310 flow [2023-11-17 15:18:35,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2023-11-17 15:18:35,250 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:18:35,267 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 126 transitions, 264 flow [2023-11-17 15:18:35,270 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 126 transitions, 264 flow [2023-11-17 15:18:35,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 126 transitions, 264 flow [2023-11-17 15:18:35,306 INFO L124 PetriNetUnfolderBase]: 1/126 cut-off events. [2023-11-17 15:18:35,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 1/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-11-17 15:18:35,309 INFO L119 LiptonReduction]: Number of co-enabled transitions 2002 [2023-11-17 15:18:46,093 INFO L134 LiptonReduction]: Checked pairs total: 4083 [2023-11-17 15:18:46,093 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-11-17 15:18:46,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:18:46,107 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;@2f96714b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:18:46,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:18:46,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:18:46,112 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-17 15:18:46,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:46,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:46,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:46,113 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 2 more)] === [2023-11-17 15:18:46,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1924754113, now seen corresponding path program 1 times [2023-11-17 15:18:46,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:46,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098989093] [2023-11-17 15:18:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:46,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:46,478 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,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:46,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098989093] [2023-11-17 15:18:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098989093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:46,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632054180] [2023-11-17 15:18:46,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:46,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:46,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 253 [2023-11-17 15:18:46,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:46,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 253 [2023-11-17 15:18:46,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:47,081 INFO L124 PetriNetUnfolderBase]: 2773/3846 cut-off events. [2023-11-17 15:18:47,081 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-11-17 15:18:47,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 3846 events. 2773/3846 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17057 event pairs, 561 based on Foata normal form. 40/3886 useless extension candidates. Maximal degree in co-relation 7840. Up to 3461 conditions per place. [2023-11-17 15:18:47,103 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-11-17 15:18:47,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 185 flow [2023-11-17 15:18:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-17 15:18:47,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2023-11-17 15:18:47,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-17 15:18:47,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-17 15:18:47,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:47,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-17 15:18:47,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,136 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 58 flow. Second operand 3 states and 429 transitions. [2023-11-17 15:18:47,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 185 flow [2023-11-17 15:18:47,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:18:47,141 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-11-17 15:18:47,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-17 15:18:47,146 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-17 15:18:47,146 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-11-17 15:18:47,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:47,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:47,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:18:47,147 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 2 more)] === [2023-11-17 15:18:47,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -462166446, now seen corresponding path program 1 times [2023-11-17 15:18:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129545821] [2023-11-17 15:18:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:47,923 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,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:47,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129545821] [2023-11-17 15:18:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129545821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:47,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922841155] [2023-11-17 15:18:47,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:47,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:47,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:47,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:47,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2023-11-17 15:18:47,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:47,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2023-11-17 15:18:47,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:48,387 INFO L124 PetriNetUnfolderBase]: 2766/3837 cut-off events. [2023-11-17 15:18:48,388 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2023-11-17 15:18:48,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8835 conditions, 3837 events. 2766/3837 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15913 event pairs, 1391 based on Foata normal form. 2/3839 useless extension candidates. Maximal degree in co-relation 8824. Up to 3802 conditions per place. [2023-11-17 15:18:48,402 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 34 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-11-17 15:18:48,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 184 flow [2023-11-17 15:18:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-17 15:18:48,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4795783926218709 [2023-11-17 15:18:48,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-17 15:18:48,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-17 15:18:48,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:48,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-17 15:18:48,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:48,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:48,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:48,408 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 364 transitions. [2023-11-17 15:18:48,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 184 flow [2023-11-17 15:18:48,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:48,413 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 96 flow [2023-11-17 15:18:48,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-11-17 15:18:48,413 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-11-17 15:18:48,414 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 96 flow [2023-11-17 15:18:48,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:48,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:48,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:48,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:18:48,421 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 2 more)] === [2023-11-17 15:18:48,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1442226697, now seen corresponding path program 1 times [2023-11-17 15:18:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866562903] [2023-11-17 15:18:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:48,497 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:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866562903] [2023-11-17 15:18:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866562903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601846631] [2023-11-17 15:18:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:48,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:48,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:48,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 253 [2023-11-17 15:18:48,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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:48,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:48,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 253 [2023-11-17 15:18:48,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:49,049 INFO L124 PetriNetUnfolderBase]: 3380/4779 cut-off events. [2023-11-17 15:18:49,049 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2023-11-17 15:18:49,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11500 conditions, 4779 events. 3380/4779 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22194 event pairs, 1700 based on Foata normal form. 120/4899 useless extension candidates. Maximal degree in co-relation 11487. Up to 3034 conditions per place. [2023-11-17 15:18:49,067 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 42 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-11-17 15:18:49,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 230 flow [2023-11-17 15:18:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-17 15:18:49,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2023-11-17 15:18:49,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-17 15:18:49,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-17 15:18:49,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:49,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-17 15:18:49,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,072 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 96 flow. Second operand 3 states and 429 transitions. [2023-11-17 15:18:49,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 230 flow [2023-11-17 15:18:49,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:49,073 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 103 flow [2023-11-17 15:18:49,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-17 15:18:49,074 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-11-17 15:18:49,074 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 103 flow [2023-11-17 15:18:49,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:49,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:49,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:18:49,075 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 2 more)] === [2023-11-17 15:18:49,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1051512673, now seen corresponding path program 1 times [2023-11-17 15:18:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999979600] [2023-11-17 15:18:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:49,949 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,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999979600] [2023-11-17 15:18:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999979600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:49,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636311306] [2023-11-17 15:18:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:49,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:18:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:49,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:18:49,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:18:49,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 253 [2023-11-17 15:18:49,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 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,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:49,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 253 [2023-11-17 15:18:49,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:50,485 INFO L124 PetriNetUnfolderBase]: 3353/4742 cut-off events. [2023-11-17 15:18:50,485 INFO L125 PetriNetUnfolderBase]: For 3255/3255 co-relation queries the response was YES. [2023-11-17 15:18:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12042 conditions, 4742 events. 3353/4742 cut-off events. For 3255/3255 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21377 event pairs, 882 based on Foata normal form. 6/4748 useless extension candidates. Maximal degree in co-relation 12028. Up to 4484 conditions per place. [2023-11-17 15:18:50,509 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 34 selfloop transitions, 5 changer transitions 1/40 dead transitions. [2023-11-17 15:18:50,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 230 flow [2023-11-17 15:18:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-17 15:18:50,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46903820816864294 [2023-11-17 15:18:50,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-17 15:18:50,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-17 15:18:50,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:50,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-17 15:18:50,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,514 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 103 flow. Second operand 3 states and 356 transitions. [2023-11-17 15:18:50,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 230 flow [2023-11-17 15:18:50,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 220 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:50,520 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 127 flow [2023-11-17 15:18:50,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-17 15:18:50,520 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-11-17 15:18:50,520 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 127 flow [2023-11-17 15:18:50,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 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,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:50,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:50,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:18:50,521 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 2 more)] === [2023-11-17 15:18:50,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash 680751874, now seen corresponding path program 1 times [2023-11-17 15:18:50,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:50,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081277374] [2023-11-17 15:18:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:50,861 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,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081277374] [2023-11-17 15:18:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081277374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686302718] [2023-11-17 15:18:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:50,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:50,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 253 [2023-11-17 15:18:50,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:50,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 253 [2023-11-17 15:18:50,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:51,411 INFO L124 PetriNetUnfolderBase]: 3319/4696 cut-off events. [2023-11-17 15:18:51,412 INFO L125 PetriNetUnfolderBase]: For 3552/3552 co-relation queries the response was YES. [2023-11-17 15:18:51,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12430 conditions, 4696 events. 3319/4696 cut-off events. For 3552/3552 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21041 event pairs, 832 based on Foata normal form. 8/4704 useless extension candidates. Maximal degree in co-relation 12414. Up to 4189 conditions per place. [2023-11-17 15:18:51,426 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 37 selfloop transitions, 5 changer transitions 1/43 dead transitions. [2023-11-17 15:18:51,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 259 flow [2023-11-17 15:18:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-11-17 15:18:51,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48616600790513836 [2023-11-17 15:18:51,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-11-17 15:18:51,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-11-17 15:18:51,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:51,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-11-17 15:18:51,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,430 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 127 flow. Second operand 3 states and 369 transitions. [2023-11-17 15:18:51,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 259 flow [2023-11-17 15:18:51,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:51,432 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 151 flow [2023-11-17 15:18:51,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-17 15:18:51,432 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-11-17 15:18:51,433 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 151 flow [2023-11-17 15:18:51,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:51,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:51,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:18:51,433 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 2 more)] === [2023-11-17 15:18:51,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 680751254, now seen corresponding path program 1 times [2023-11-17 15:18:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584883701] [2023-11-17 15:18:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:51,627 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:51,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584883701] [2023-11-17 15:18:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584883701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:51,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508580954] [2023-11-17 15:18:51,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:51,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:51,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:51,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:51,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 253 [2023-11-17 15:18:51,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 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,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:51,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 253 [2023-11-17 15:18:51,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:52,202 INFO L124 PetriNetUnfolderBase]: 3229/4570 cut-off events. [2023-11-17 15:18:52,202 INFO L125 PetriNetUnfolderBase]: For 4539/4539 co-relation queries the response was YES. [2023-11-17 15:18:52,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12698 conditions, 4570 events. 3229/4570 cut-off events. For 4539/4539 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20338 event pairs, 912 based on Foata normal form. 24/4594 useless extension candidates. Maximal degree in co-relation 12680. Up to 3883 conditions per place. [2023-11-17 15:18:52,224 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 40 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2023-11-17 15:18:52,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 283 flow [2023-11-17 15:18:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-17 15:18:52,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5573122529644269 [2023-11-17 15:18:52,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-17 15:18:52,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-17 15:18:52,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:52,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-17 15:18:52,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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,228 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 151 flow. Second operand 3 states and 423 transitions. [2023-11-17 15:18:52,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 283 flow [2023-11-17 15:18:52,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:52,232 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 160 flow [2023-11-17 15:18:52,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-17 15:18:52,232 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-17 15:18:52,233 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 160 flow [2023-11-17 15:18:52,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 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,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:52,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:52,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:18:52,233 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 2 more)] === [2023-11-17 15:18:52,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash -371531121, now seen corresponding path program 1 times [2023-11-17 15:18:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904895868] [2023-11-17 15:18:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:52,378 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,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904895868] [2023-11-17 15:18:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904895868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971327581] [2023-11-17 15:18:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:52,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:52,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 253 [2023-11-17 15:18:52,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:52,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 253 [2023-11-17 15:18:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:52,988 INFO L124 PetriNetUnfolderBase]: 3885/5483 cut-off events. [2023-11-17 15:18:52,989 INFO L125 PetriNetUnfolderBase]: For 6764/6764 co-relation queries the response was YES. [2023-11-17 15:18:52,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15290 conditions, 5483 events. 3885/5483 cut-off events. For 6764/6764 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25229 event pairs, 2400 based on Foata normal form. 32/5515 useless extension candidates. Maximal degree in co-relation 15270. Up to 4795 conditions per place. [2023-11-17 15:18:53,008 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 38 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2023-11-17 15:18:53,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 306 flow [2023-11-17 15:18:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-11-17 15:18:53,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-17 15:18:53,011 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-11-17 15:18:53,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-11-17 15:18:53,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:53,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-11-17 15:18:53,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 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,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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,013 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 160 flow. Second operand 4 states and 529 transitions. [2023-11-17 15:18:53,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 306 flow [2023-11-17 15:18:53,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:53,017 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 212 flow [2023-11-17 15:18:53,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-17 15:18:53,018 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-11-17 15:18:53,019 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 212 flow [2023-11-17 15:18:53,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:53,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:53,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:18:53,019 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 2 more)] === [2023-11-17 15:18:53,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1192939989, now seen corresponding path program 2 times [2023-11-17 15:18:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030206277] [2023-11-17 15:18:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:53,469 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030206277] [2023-11-17 15:18:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030206277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:53,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931093092] [2023-11-17 15:18:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:53,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:53,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 253 [2023-11-17 15:18:53,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:53,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 253 [2023-11-17 15:18:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:54,111 INFO L124 PetriNetUnfolderBase]: 3812/5386 cut-off events. [2023-11-17 15:18:54,111 INFO L125 PetriNetUnfolderBase]: For 7456/7456 co-relation queries the response was YES. [2023-11-17 15:18:54,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17300 conditions, 5386 events. 3812/5386 cut-off events. For 7456/7456 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24855 event pairs, 1635 based on Foata normal form. 38/5424 useless extension candidates. Maximal degree in co-relation 17279. Up to 4632 conditions per place. [2023-11-17 15:18:54,133 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 57 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2023-11-17 15:18:54,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 506 flow [2023-11-17 15:18:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:18:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:18:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-11-17 15:18:54,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-17 15:18:54,135 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-11-17 15:18:54,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-11-17 15:18:54,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:54,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-11-17 15:18:54,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 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,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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,138 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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,138 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 212 flow. Second operand 4 states and 529 transitions. [2023-11-17 15:18:54,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 506 flow [2023-11-17 15:18:54,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 475 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:54,145 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 319 flow [2023-11-17 15:18:54,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-11-17 15:18:54,147 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-11-17 15:18:54,148 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 319 flow [2023-11-17 15:18:54,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:54,148 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,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:18:54,148 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 2 more)] === [2023-11-17 15:18:54,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1323108866, now seen corresponding path program 1 times [2023-11-17 15:18:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130990958] [2023-11-17 15:18:54,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:54,504 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,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:54,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130990958] [2023-11-17 15:18:54,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130990958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33695179] [2023-11-17 15:18:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:54,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:54,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:54,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 253 [2023-11-17 15:18:54,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 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,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:54,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 253 [2023-11-17 15:18:54,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:55,427 INFO L124 PetriNetUnfolderBase]: 5327/7584 cut-off events. [2023-11-17 15:18:55,427 INFO L125 PetriNetUnfolderBase]: For 16300/16300 co-relation queries the response was YES. [2023-11-17 15:18:55,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25708 conditions, 7584 events. 5327/7584 cut-off events. For 16300/16300 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38610 event pairs, 1889 based on Foata normal form. 72/7656 useless extension candidates. Maximal degree in co-relation 25685. Up to 4296 conditions per place. [2023-11-17 15:18:55,463 INFO L140 encePairwiseOnDemand]: 243/253 looper letters, 54 selfloop transitions, 17 changer transitions 3/74 dead transitions. [2023-11-17 15:18:55,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 581 flow [2023-11-17 15:18:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-11-17 15:18:55,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185770750988142 [2023-11-17 15:18:55,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-11-17 15:18:55,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-11-17 15:18:55,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:55,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-11-17 15:18:55,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 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:55,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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,470 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 319 flow. Second operand 5 states and 656 transitions. [2023-11-17 15:18:55,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 581 flow [2023-11-17 15:18:55,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 566 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:55,481 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 346 flow [2023-11-17 15:18:55,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-11-17 15:18:55,482 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-11-17 15:18:55,482 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 346 flow [2023-11-17 15:18:55,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 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,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:55,484 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:55,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:18:55,485 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 2 more)] === [2023-11-17 15:18:55,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 710368097, now seen corresponding path program 1 times [2023-11-17 15:18:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:55,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757003017] [2023-11-17 15:18:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:55,635 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,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757003017] [2023-11-17 15:18:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757003017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976530735] [2023-11-17 15:18:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:55,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:55,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253 [2023-11-17 15:18:55,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:55,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253 [2023-11-17 15:18:55,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:56,353 INFO L124 PetriNetUnfolderBase]: 4778/7098 cut-off events. [2023-11-17 15:18:56,353 INFO L125 PetriNetUnfolderBase]: For 20928/20928 co-relation queries the response was YES. [2023-11-17 15:18:56,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25039 conditions, 7098 events. 4778/7098 cut-off events. For 20928/20928 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38987 event pairs, 883 based on Foata normal form. 524/7622 useless extension candidates. Maximal degree in co-relation 25014. Up to 4958 conditions per place. [2023-11-17 15:18:56,383 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 77 selfloop transitions, 5 changer transitions 62/144 dead transitions. [2023-11-17 15:18:56,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 144 transitions, 1334 flow [2023-11-17 15:18:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-11-17 15:18:56,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5438735177865612 [2023-11-17 15:18:56,385 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-11-17 15:18:56,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-11-17 15:18:56,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:56,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-11-17 15:18:56,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:56,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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:56,388 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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:56,388 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 346 flow. Second operand 5 states and 688 transitions. [2023-11-17 15:18:56,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 144 transitions, 1334 flow [2023-11-17 15:18:56,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 144 transitions, 1259 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:18:56,402 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 371 flow [2023-11-17 15:18:56,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=371, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-11-17 15:18:56,403 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-11-17 15:18:56,403 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 371 flow [2023-11-17 15:18:56,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:56,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:56,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:18:56,404 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 2 more)] === [2023-11-17 15:18:56,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash -653985821, now seen corresponding path program 1 times [2023-11-17 15:18:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:56,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012211616] [2023-11-17 15:18:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:56,544 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:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:56,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012211616] [2023-11-17 15:18:56,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012211616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:56,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:56,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:56,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839959892] [2023-11-17 15:18:56,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:56,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:56,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:56,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:56,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253 [2023-11-17 15:18:56,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:56,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:56,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253 [2023-11-17 15:18:56,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:57,070 INFO L124 PetriNetUnfolderBase]: 2965/4604 cut-off events. [2023-11-17 15:18:57,070 INFO L125 PetriNetUnfolderBase]: For 14819/14819 co-relation queries the response was YES. [2023-11-17 15:18:57,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19839 conditions, 4604 events. 2965/4604 cut-off events. For 14819/14819 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 25060 event pairs, 330 based on Foata normal form. 396/5000 useless extension candidates. Maximal degree in co-relation 19810. Up to 1997 conditions per place. [2023-11-17 15:18:57,091 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 95 selfloop transitions, 9 changer transitions 58/162 dead transitions. [2023-11-17 15:18:57,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 162 transitions, 1477 flow [2023-11-17 15:18:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2023-11-17 15:18:57,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2023-11-17 15:18:57,093 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 828 transitions. [2023-11-17 15:18:57,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 828 transitions. [2023-11-17 15:18:57,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:57,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 828 transitions. [2023-11-17 15:18:57,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 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,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 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,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 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,097 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 371 flow. Second operand 6 states and 828 transitions. [2023-11-17 15:18:57,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 162 transitions, 1477 flow [2023-11-17 15:18:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 162 transitions, 1426 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:57,121 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 404 flow [2023-11-17 15:18:57,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-17 15:18:57,122 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2023-11-17 15:18:57,122 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 404 flow [2023-11-17 15:18:57,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 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,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:57,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:18:57,122 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 2 more)] === [2023-11-17 15:18:57,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1233481478, now seen corresponding path program 1 times [2023-11-17 15:18:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560326733] [2023-11-17 15:18:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:57,262 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,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560326733] [2023-11-17 15:18:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560326733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136343474] [2023-11-17 15:18:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:18:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:18:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:18:57,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253 [2023-11-17 15:18:57,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 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,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:57,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253 [2023-11-17 15:18:57,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:57,688 INFO L124 PetriNetUnfolderBase]: 1835/2916 cut-off events. [2023-11-17 15:18:57,688 INFO L125 PetriNetUnfolderBase]: For 9487/9487 co-relation queries the response was YES. [2023-11-17 15:18:57,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13559 conditions, 2916 events. 1835/2916 cut-off events. For 9487/9487 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15020 event pairs, 215 based on Foata normal form. 181/3097 useless extension candidates. Maximal degree in co-relation 13527. Up to 1212 conditions per place. [2023-11-17 15:18:57,699 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 102 selfloop transitions, 13 changer transitions 48/163 dead transitions. [2023-11-17 15:18:57,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 163 transitions, 1525 flow [2023-11-17 15:18:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:18:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:18:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 966 transitions. [2023-11-17 15:18:57,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2023-11-17 15:18:57,701 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 966 transitions. [2023-11-17 15:18:57,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 966 transitions. [2023-11-17 15:18:57,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:57,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 966 transitions. [2023-11-17 15:18:57,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 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,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 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,706 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 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,706 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 404 flow. Second operand 7 states and 966 transitions. [2023-11-17 15:18:57,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 163 transitions, 1525 flow [2023-11-17 15:18:57,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 163 transitions, 1459 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-17 15:18:57,737 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 434 flow [2023-11-17 15:18:57,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-17 15:18:57,738 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2023-11-17 15:18:57,738 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 434 flow [2023-11-17 15:18:57,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 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,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:57,739 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,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:18:57,739 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 2 more)] === [2023-11-17 15:18:57,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1343508803, now seen corresponding path program 1 times [2023-11-17 15:18:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296048195] [2023-11-17 15:18:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:57,907 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,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:57,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296048195] [2023-11-17 15:18:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296048195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:18:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915255318] [2023-11-17 15:18:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:57,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:57,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:57,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253 [2023-11-17 15:18:57,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 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,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:57,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253 [2023-11-17 15:18:57,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:58,245 INFO L124 PetriNetUnfolderBase]: 1454/2277 cut-off events. [2023-11-17 15:18:58,245 INFO L125 PetriNetUnfolderBase]: For 6931/6931 co-relation queries the response was YES. [2023-11-17 15:18:58,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10261 conditions, 2277 events. 1454/2277 cut-off events. For 6931/6931 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11131 event pairs, 202 based on Foata normal form. 39/2316 useless extension candidates. Maximal degree in co-relation 10228. Up to 906 conditions per place. [2023-11-17 15:18:58,254 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 73 selfloop transitions, 17 changer transitions 47/137 dead transitions. [2023-11-17 15:18:58,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1289 flow [2023-11-17 15:18:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:18:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:18:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions. [2023-11-17 15:18:58,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2023-11-17 15:18:58,257 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions. [2023-11-17 15:18:58,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions. [2023-11-17 15:18:58,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:58,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions. [2023-11-17 15:18:58,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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,262 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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,262 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 434 flow. Second operand 8 states and 1078 transitions. [2023-11-17 15:18:58,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1289 flow [2023-11-17 15:18:58,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 137 transitions, 1202 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-11-17 15:18:58,297 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 362 flow [2023-11-17 15:18:58,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=362, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-11-17 15:18:58,298 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2023-11-17 15:18:58,298 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 362 flow [2023-11-17 15:18:58,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 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,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:58,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:58,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:18:58,299 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 2 more)] === [2023-11-17 15:18:58,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:58,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1541562165, now seen corresponding path program 1 times [2023-11-17 15:18:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437056241] [2023-11-17 15:18:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:58,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:18:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:58,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:18:58,450 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:18:58,450 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:18:58,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-17 15:18:58,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:18:58,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:18:58,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-17 15:18:58,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:18:58,452 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:58,456 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:18:58,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:18:58,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-17 15:18:58,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-17 15:18:58,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-17 15:18:58,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated [2023-11-17 15:18:58,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:18:58 BasicIcfg [2023-11-17 15:18:58,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:18:58,540 INFO L158 Benchmark]: Toolchain (without parser) took 24870.53ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 149.6MB in the beginning and 521.7MB in the end (delta: -372.1MB). Peak memory consumption was 548.3MB. Max. memory is 8.0GB. [2023-11-17 15:18:58,540 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:18:58,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.35ms. Allocated memory is still 190.8MB. Free memory was 149.3MB in the beginning and 123.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-11-17 15:18:58,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.62ms. Allocated memory is still 190.8MB. Free memory was 123.8MB in the beginning and 121.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:58,540 INFO L158 Benchmark]: Boogie Preprocessor took 30.18ms. Allocated memory is still 190.8MB. Free memory was 121.0MB in the beginning and 118.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:58,540 INFO L158 Benchmark]: RCFGBuilder took 864.90ms. Allocated memory is still 190.8MB. Free memory was 118.5MB in the beginning and 86.8MB in the end (delta: 31.7MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2023-11-17 15:18:58,541 INFO L158 Benchmark]: TraceAbstraction took 23497.07ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 85.8MB in the beginning and 521.7MB in the end (delta: -435.9MB). Peak memory consumption was 483.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:58,541 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.13ms. Allocated memory is still 190.8MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.35ms. Allocated memory is still 190.8MB. Free memory was 149.3MB in the beginning and 123.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.62ms. Allocated memory is still 190.8MB. Free memory was 123.8MB in the beginning and 121.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.18ms. Allocated memory is still 190.8MB. Free memory was 121.0MB in the beginning and 118.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 864.90ms. Allocated memory is still 190.8MB. Free memory was 118.5MB in the beginning and 86.8MB in the end (delta: 31.7MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. * TraceAbstraction took 23497.07ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 85.8MB in the beginning and 521.7MB in the end (delta: -435.9MB). Peak memory consumption was 483.1MB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre31 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: 10.8s, 138 PlacesBefore, 36 PlacesAfterwards, 126 TransitionsBefore, 23 TransitionsAfterwards, 2002 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 4083 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2064, independent: 1897, independent conditional: 0, independent unconditional: 1897, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1301, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1301, independent: 1228, independent conditional: 0, independent unconditional: 1228, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 669, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 643, dependent conditional: 0, dependent unconditional: 643, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2064, independent: 649, independent conditional: 0, independent unconditional: 649, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 1301, unknown conditional: 0, unknown unconditional: 1301] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t2146; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={7:0}, t2146={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2147; [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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, t2145={7:0}, t2146={5:0}, t2147={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2148; [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={7:0}, t2146={5:0}, t2147={8:0}, t2148={9:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2145={7:0}, t2146={5:0}, t2147={8:0}, t2148={9:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, 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=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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. - 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 180 locations, 5 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.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1063 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 0 mSDtfsCounter, 1063 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:58,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...